Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736692
details
property
value
status
complete
benchmark
BradleyMannaSipma-ICALP2005-Fig1_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n024.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
3.34600496292 seconds
cpu usage
9.806845532
max memory
8.44546048E8
stage attributes
key
value
output-size
18702
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_N -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l16, not((main_N < 536870912))> <l1, l2, (main_N < 536870912)> <l2, l16, not((main_x < 536870912))> <l2, l3, (main_x < 536870912)> <l3, l16, not((main_y < 536870912))> <l3, l4, (main_y < 536870912)> <l4, l5, (main_x >= ~(1073741824))> <l4, l16, not((main_x >= ~(1073741824)))> <l5, l6, ((main_x + main_y) >= 0)> <l5, l15, not(((main_x + main_y) >= 0))> <l6, l7, true> <l7, l14, not((main_x <= main_N))> <l7, l8, (main_x <= main_N)> <l8, l9, not((¿functionCall(__VERIFIER_nondet_int) = 0))> <l8, l11, (¿functionCall(__VERIFIER_nondet_int) = 0)> <l9, l10, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}> <l10, l13, true> <l11, l12, true, seq{main_x -> (main_x + 1)}> <l12, l13, true> <l13, l7, true> <l14, l15, true> <l15, l16, true> <l16, l17, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: <l0, l18, true, seq{main__func_return_ -> 0}> <l18, l19, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l19, l20, true, seq{main_x -> varCall_1}> <l20, l21, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l21, l22, true, seq{main_y -> varCall_2}> <l22, l23, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}> <l23, l1, true, seq{main_N -> varCall_3}> <l1, l2, (main_N < 536870912)> <l1, l16, not((main_N < 536870912))> <l2, l3, (main_x < 536870912)> <l2, l16, not((main_x < 536870912))> <l3, l4, (main_y < 536870912)> <l3, l16, not((main_y < 536870912))> <l4, l5, (main_x >= ~(1073741824))> <l4, l16, not((main_x >= ~(1073741824)))> <l5, l6, ((main_x + main_y) >= 0)> <l5, l15, not(((main_x + main_y) >= 0))> <l6, l7, true> <l7, l8, (main_x <= main_N)> <l7, l14, not((main_x <= main_N))> <l8, l24, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}> <l24, l11, (varCall_4 = 0)> <l24, l9, (varCall_4 = 1)> <l9, l10, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}> <l10, l13, true> <l11, l12, true, seq{main_x -> (main_x + 1)}> <l12, l13, true> <l13, l7, true> <l14, l15, true> <l15, l16, true> <l16, l17, true, seq{main__func_return_ -> 0}> Fresh variables:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257