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)}> 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.001745 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000542s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001381s [5338 : 5340] [5338 : 5341] Successful child: 5340 [ 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.000280s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000326s 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.000503s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001627s [5338 : 5345] [5338 : 5346] Successful child: 5345 [ 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.000862s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001000s 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.001298s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003828s [5338 : 5350] [5338 : 5351] Successful child: 5350 [ 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.000269s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000309s 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.000347s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001209s [5338 : 5355] [5338 : 5356] Successful child: 5355 [ 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.000365s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000418s 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.000451s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001319s [5338 : 5360] [5338 : 5361] Successful child: 5360 [ 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: [5338 : 5365] [5338 : 5366] 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.003064s 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.001112s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004490s [5338 : 5367] [5338 : 5368] Successful child: 5367 [ 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: [5338 : 5372] [5338 : 5373] [5338 : 5374] [5338 : 5375] 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.001438s 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.000360s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001372s [5338 : 5376] [5338 : 5377] Successful child: 5376 [ 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: [5338 : 5381] [5338 : 5382] [5338 : 5383] [5338 : 5384] [5338 : 5385] [5338 : 5386] 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.002017s 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.000851s 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.000358s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001394s [5338 : 5387] [5338 : 5388] Successful child: 5387 [ 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: [5338 : 5392] [5338 : 5393] [5338 : 5394] [5338 : 5395] [5338 : 5396] [5338 : 5397] 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.002741s 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.001182s 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.000893s 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.000363s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001480s [5338 : 5398] [5338 : 5399] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034525s Time used: 0.03381 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038434s Time used: 0.038432 LOG: SAT solveNonLinear - Elapsed time: 0.072959s Cost: 1; Total time: 0.072242 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.000404s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001700s [5338 : 5403] [5338 : 5404] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030372s Time used: 0.029554 [5338 : 5570] [5338 : 5571] Successful child: 5570 Program does NOT terminate