Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736347
details
property
value
status
complete
benchmark
LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
6.86831688881 seconds
cpu usage
20.099415249
max memory
7.72517888E8
stage attributes
key
value
output-size
34340
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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_z -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l15, not((main_x <= 10000))> <l1, l2, (main_x <= 10000)> <l2, l15, not((main_x >= ~(10000)))> <l2, l3, (main_x >= ~(10000))> <l3, l15, not((main_y <= 10000))> <l3, l4, (main_y <= 10000)> <l4, l5, (main_z <= 10000)> <l4, l15, not((main_z <= 10000))> <l5, l6, true> <l6, l14, not((main_y >= 1))> <l6, l7, (main_y >= 1)> <l7, l8, true, seq{main_x -> (main_x - 1)}> <l8, l9, true> <l9, l12, not((main_y < main_z))> <l9, l10, (main_y < main_z)> <l10, l11, true, seq{main_x -> (main_x + 1), main_z -> (main_z - 1)}> <l11, l9, true> <l12, l13, true, seq{main_y -> (main_x + main_y)}> <l13, l6, true> <l14, l15, true> <l15, l16, 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, l17, true, seq{main__func_return_ -> 0}> <l17, l18, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l18, l19, true, seq{main_x -> varCall_1}> <l19, l20, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l20, l21, true, seq{main_y -> varCall_2}> <l21, l22, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}> <l22, l1, true, seq{main_z -> varCall_3}> <l1, l2, (main_x <= 10000)> <l1, l15, not((main_x <= 10000))> <l2, l3, (main_x >= ~(10000))> <l2, l15, not((main_x >= ~(10000)))> <l3, l4, (main_y <= 10000)> <l3, l15, not((main_y <= 10000))> <l4, l5, (main_z <= 10000)> <l4, l15, not((main_z <= 10000))> <l5, l6, true> <l6, l7, (main_y >= 1)> <l6, l14, not((main_y >= 1))> <l7, l8, true, seq{main_x -> (main_x - 1)}> <l8, l9, true> <l9, l10, (main_y < main_z)> <l9, l12, not((main_y < main_z))> <l10, l11, true, seq{main_x -> (main_x + 1), main_z -> (main_z - 1)}> <l11, l9, true> <l12, l13, true, seq{main_y -> (main_x + main_y)}> <l13, l6, true> <l14, l15, true> <l15, l16, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257