/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> = 7))> = 7)> main_a, main_a -> main_b, main_b -> (main_olda + 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}> = 7)> = 7))> main_a, main_a -> main_b, main_b -> (main_olda + 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, ()] | a | local variable | integer | | b | local variable | integer | | olda | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 7), par{main_a -> main_b, main_b -> (main_a + 1)}> = 7))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b 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.001964 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000519s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001502s [51686 : 51687] [51686 : 51688] Successful child: 51687 [ 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_b, main_b -> 1 + main_a, 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_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 2 - Process 1 * Exit transition: * Postcondition : main_a <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000475s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000566s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 2 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000501s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001607s [51686 : 51692] [51686 : 51693] Successful child: 51692 [ 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_b, main_b -> 1 + main_a, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 3 - Process 2 * Exit transition: * Postcondition : main_a <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000543s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000634s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 3 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000490s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001591s [51686 : 51697] [51686 : 51698] Successful child: 51697 [ 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_b, main_b -> 1 + main_a, 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_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 5 - Process 3 * Exit transition: * Postcondition : main_a <= 5 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000542s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000634s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 5 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000490s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001595s [51686 : 51702] [51686 : 51703] Successful child: 51702 [ 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_b, main_b -> 1 + main_a, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 6 - Process 4 * Exit transition: * Postcondition : main_a <= 6 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000563s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000657s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 6 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000495s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001610s [51686 : 51707] [51686 : 51708] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006343s Time used: 0.006013 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011516s Time used: 0.01151 LOG: SAT solveNonLinear - Elapsed time: 0.017859s Cost: 1; Total time: 0.017523 Quasi-ranking function: 50000 - main_a - main_b New Graphs: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000590s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002132s [51686 : 51712] [51686 : 51713] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007361s Time used: 0.007043 [51686 : 51717] [51686 : 51721] Successful child: 51717 Program does NOT terminate