NO Solver Timeout: 4 Global Timeout: 60 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)}> 1))> 1)> = (2 * main_oldx)))> = (2 * main_oldx))> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 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}> 1)> 1))> = (2 * main_oldx))> = (2 * main_oldx)))> main_x}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> 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, ()] | x | local variable | integer | | oldx | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 1) /\ (main_x >= (2 * main_oldx)), par{main_x -> undef4, main_oldx -> main_x}> 1) /\ not((main_x >= (2 * main_oldx)))> 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: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx 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.001861 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000680s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002077s [6096 : 6098] [6096 : 6099] Successful child: 6098 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, 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.000379s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000459s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000670s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002227s [6096 : 6106] [6096 : 6107] Successful child: 6106 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= main_oldx - Process 2 * Exit transition: * Postcondition : main_x <= main_oldx LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000488s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000582s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000683s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002527s [6096 : 6111] [6096 : 6112] Successful child: 6111 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 3 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000575s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000672s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000682s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002535s [6096 : 6117] [6096 : 6118] Successful child: 6117 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 1 - Process 4 * Exit transition: * Postcondition : main_x <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000594s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000693s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000698s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002534s [6096 : 6130] [6096 : 6131] Successful child: 6130 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [6096 : 6146] [6096 : 6147] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2 <= main_oldx , main_x <= 1 + main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001707s Ranking function: 2 - 2*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000733s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003024s [6096 : 6149] [6096 : 6150] Successful child: 6149 [ 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: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [6096 : 6193] [6096 : 6194] [6096 : 6195] [6096 : 6196] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 2 + main_oldx , 3 <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003029s Ranking function: 1 + (~(1) / 2)*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000729s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002852s [6096 : 6197] [6096 : 6198] Successful child: 6197 [ 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: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [6096 : 6261] [6096 : 6262] [6096 : 6263] [6096 : 6264] [6096 : 6265] [6096 : 6266] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 3 + main_oldx , 4 <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004243s Ranking function: 30 - 15*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001747s Ranking function: 63 - 21*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000735s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002879s [6096 : 6267] [6096 : 6268] Successful child: 6267 [ 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: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [6096 : 6334] [6096 : 6335] [6096 : 6336] [6096 : 6337] [6096 : 6338] [6096 : 6339] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 4 + main_oldx , 5 <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005839s Ranking function: 30 - 15*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002462s Ranking function: 63 - 21*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001859s Ranking function: 108 - 27*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000743s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003097s [6096 : 6342] [6096 : 6343] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034819s Time used: 0.03406 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.089213s Time used: 0.089201 LOG: SAT solveNonLinear - Elapsed time: 0.124032s Cost: 1; Total time: 0.123261 Quasi-ranking function: 50000 - main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000852s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003546s [6096 : 6471] [6096 : 6472] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023770s Time used: 0.023219 [6096 : 6641] [6096 : 6645] Successful child: 6641 Program does NOT terminate