/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 1)}> 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: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> 0)> 0))> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z + 1)}> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002387 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000857s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002034s [59328 : 59330] [59328 : 59331] Successful child: 59330 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000562s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000656s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000812s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002158s [59328 : 59336] [59328 : 59337] Successful child: 59336 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 2 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000612s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000719s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000797s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002134s [59328 : 59343] [59328 : 59344] Successful child: 59343 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Ranking function: -main_y - main_z New Graphs: [59328 : 59552] [59328 : 59553] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , 0 <= main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001528s Ranking function: -main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000621s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002333s [59328 : 59554] [59328 : 59555] Successful child: 59554 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x + main_y + main_z <= 0 - Process 3 * Exit transition: * Postcondition : main_x + main_y + main_z <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000456s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000591s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000678s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002399s [59328 : 59559] [59328 : 59560] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010563s Time used: 0.01008 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018529s Time used: 0.018526 LOG: SAT solveNonLinear - Elapsed time: 0.029092s Cost: 1; Total time: 0.028606 Quasi-ranking function: 50000 - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000692s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003221s [59328 : 59801] [59328 : 59802] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010911s Time used: 0.010442 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013330s Time used: 0.013327 LOG: SAT solveNonLinear - Elapsed time: 0.024241s Cost: 1; Total time: 0.023769 Quasi-ranking function: 50000 - main_y New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000793s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011413s [59328 : 59914] [59328 : 59915] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011496s Time used: 0.01096 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016346s Time used: 0.016343 LOG: SAT solveNonLinear - Elapsed time: 0.027842s Cost: 1; Total time: 0.027303 Quasi-ranking function: 50000 - main_x + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000875s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006278s [59328 : 59919] [59328 : 59920] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013386s Time used: 0.012823 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019550s Time used: 0.019546 LOG: SAT solveNonLinear - Elapsed time: 0.032936s Cost: 1; Total time: 0.032369 Quasi-ranking function: 50000 - main_x New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000898s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005693s [59328 : 60158] [59328 : 60159] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012306s Time used: 0.011735 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017380s Time used: 0.017377 LOG: SAT solveNonLinear - Elapsed time: 0.029686s Cost: 1; Total time: 0.029112 Quasi-ranking function: 50000 - main_x - main_y + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000994s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021477s [59328 : 60510] [59328 : 60511] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011033s Time used: 0.010449 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030750s Time used: 0.030747 LOG: SAT solveNonLinear - Elapsed time: 0.041783s Cost: 1; Total time: 0.041196 Quasi-ranking function: 50000 - main_x - main_y - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000989s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020980s [59328 : 60515] [59328 : 60516] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011894s Time used: 0.011287 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017372s Time used: 0.017369 LOG: SAT solveNonLinear - Elapsed time: 0.029266s Cost: 1; Total time: 0.028656 Quasi-ranking function: 50000 - main_x - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001077s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008157s [59328 : 60520] [59328 : 60521] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014334s Time used: 0.013701 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021731s Time used: 0.021728 LOG: SAT solveNonLinear - Elapsed time: 0.036065s Cost: 1; Total time: 0.035429 Quasi-ranking function: 50000 - main_y - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001163s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012064s [59328 : 60897] [59328 : 60898] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014638s Time used: 0.01397 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018533s Time used: 0.01853 LOG: SAT solveNonLinear - Elapsed time: 0.033171s Cost: 1; Total time: 0.0325 Quasi-ranking function: 50000 - main_y + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001266s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040781s [59328 : 60902] [59328 : 60903] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013733s Time used: 0.013053 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018351s Time used: 0.018347 LOG: SAT solveNonLinear - Elapsed time: 0.032084s Cost: 1; Total time: 0.0314 Quasi-ranking function: 50000 - main_x + main_y + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001364s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023531s [59328 : 60907] [59328 : 60908] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015469s Time used: 0.014751 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018656s Time used: 0.018652 LOG: SAT solveNonLinear - Elapsed time: 0.034125s Cost: 1; Total time: 0.033403 Quasi-ranking function: 50000 - main_x + main_y - main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001468s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036396s [59328 : 61146] [59328 : 61147] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016859s Time used: 0.016124 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025358s Time used: 0.025354 LOG: SAT solveNonLinear - Elapsed time: 0.042217s Cost: 1; Total time: 0.041478 Quasi-ranking function: 50000 - main_x + main_y New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001554s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.049379s [59328 : 61351] [59328 : 61352] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017187s Time used: 0.016444 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020300s Time used: 0.020296 LOG: SAT solveNonLinear - Elapsed time: 0.037488s Cost: 1; Total time: 0.03674 Quasi-ranking function: 50000 - main_x - main_y New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> 1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001697s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.033061s [59328 : 61359] [59328 : 61360] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013735s Time used: 0.013136 [59328 : 61400] [59328 : 61404] Successful child: 61400 Program does NOT terminate