/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_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> = 1))> = 1)> = 1))> = 1)> (2 * main_a), main_b -> (3 * main_b)}> 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}> = 1)> = 1))> = 1)> = 1))> (2 * main_a), main_b -> (3 * main_b)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 7, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | a | local variable | integer | | b | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 1) /\ (main_b >= 1), par{main_a -> (2 * main_a), main_b -> (3 * main_b)}> = 1) /\ not((main_b >= 1))> = 1))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_a, main_b -> 3*main_b, 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 ) ( 7 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002121 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000608s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001775s [6548 : 6549] [6548 : 6550] Successful child: 6549 [ 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_a <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_a <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000454s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000538s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_a <= 0 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000559s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001887s [6548 : 6554] [6548 : 6555] Successful child: 6554 [ 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a + main_b <= 1 - Process 2 * Exit transition: * Postcondition : main_a + main_b <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000571s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000666s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a + main_b <= 1 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000643s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002707s [6548 : 6559] [6548 : 6560] Successful child: 6559 [ 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: 2*main_a, main_b -> 3*main_b, 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:main_b <= 0 - Process 3 * Exit transition: * Postcondition : main_b <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000502s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000602s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_b <= 0 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000642s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002692s [6548 : 6564] [6548 : 6565] Successful child: 6564 [ 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: 2*main_a, main_b -> 3*main_b, 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 0 - Process 4 * Exit transition: * Postcondition : main_a <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000545s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000655s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 0 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000641s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002707s [6548 : 6588] [6548 : 6589] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010427s Time used: 0.009981 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032380s Time used: 0.032377 LOG: SAT solveNonLinear - Elapsed time: 0.042807s Cost: 1; Total time: 0.042358 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_a + main_b [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_a, main_b -> 3*main_b, 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): 2*main_a, main_b -> 3*main_b, rest remain the same}> Quasi-ranking function: 50000 - main_b New Graphs: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000632s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003306s [6548 : 6922] [6548 : 6923] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010285s Time used: 0.009832 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035358s Time used: 0.035355 LOG: SAT solveNonLinear - Elapsed time: 0.045644s Cost: 1; Total time: 0.045187 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_a [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_a, main_b -> 3*main_b, 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): 2*main_a, main_b -> 3*main_b, rest remain the same}> Quasi-ranking function: 50000 - main_a New Graphs: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000657s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005583s [6548 : 7098] [6548 : 7099] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011739s Time used: 0.011237 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035701s Time used: 0.035697 LOG: SAT solveNonLinear - Elapsed time: 0.047441s Cost: 1; Total time: 0.046934 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_a + main_b [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_a, main_b -> 3*main_b, 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): 2*main_a, main_b -> 3*main_b, rest remain the same}> Quasi-ranking function: 50000 - 2*main_a - main_b New Graphs: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000775s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007065s [6548 : 7103] [6548 : 7104] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015087s Time used: 0.01469 [6548 : 7108] [6548 : 7112] Successful child: 7108 Program does NOT terminate