30.50/11.93 NO 30.50/11.93 30.50/11.93 Solver Timeout: 4 30.50/11.93 Global Timeout: 300 30.50/11.93 Maximum number of concurrent processes: 900 30.50/11.93 ******************************************************************************************* 30.50/11.93 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 30.50/11.93 ******************************************************************************************* 30.50/11.93 30.50/11.93 30.50/11.93 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 30.50/11.93 30.50/11.93 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 30.50/11.93 + + 30.50/11.93 Init Location: 0 30.50/11.93 Transitions: 30.50/11.93 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_w -> 5}> 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 (main_i - 1), main_i -> (main_i * ~(1))}> 30.50/11.93 30.50/11.93 main_w)> 30.50/11.93 main_w))> 30.50/11.93 (main_i + 1), main_i -> (main_i * ~(1))}> 30.50/11.93 30.50/11.93 0}> 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 0}> 30.50/11.93 30.50/11.93 Fresh variables: 30.50/11.93 30.50/11.93 Undef variables: 30.50/11.93 30.50/11.93 Abstraction variables: 30.50/11.93 30.50/11.93 Exit nodes: 30.50/11.93 30.50/11.93 Accepting locations: 30.50/11.93 30.50/11.93 Asserts: 30.50/11.93 30.50/11.93 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 30.50/11.93 30.50/11.93 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 30.50/11.93 30.50/11.93 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 30.50/11.93 30.50/11.93 Init Location: 0 30.50/11.93 Transitions: 30.50/11.93 0}> 30.50/11.93 ¿functionCall(__VERIFIER_nondet_int)}> 30.50/11.93 varCall_1, main_w -> 5}> 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 (main_i - 1), main_i -> (main_i * ~(1))}> 30.50/11.93 30.50/11.93 main_w)> 30.50/11.93 main_w))> 30.50/11.93 (main_i + 1), main_i -> (main_i * ~(1))}> 30.50/11.93 30.50/11.93 0}> 30.50/11.93 30.50/11.93 30.50/11.93 30.50/11.93 0}> 30.50/11.93 30.50/11.93 Fresh variables: 30.50/11.93 30.50/11.93 Undef variables: 30.50/11.93 30.50/11.93 Abstraction variables: 30.50/11.93 30.50/11.93 Exit nodes: 30.50/11.93 14, 30.50/11.93 Accepting locations: 30.50/11.93 30.50/11.93 Asserts: 30.50/11.93 30.50/11.93 + + 30.50/11.93 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 30.50/11.93 30.50/11.93 30.50/11.93 Function Return and Parameters Information [2 functions]: 30.50/11.93 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 30.50/11.93 __VERIFIER_nondet_int__func_return_ [function result] : int 30.50/11.93 function name: main [1 return + 0 parameters] demangled: main 30.50/11.93 main__func_return_ [function result] : int 30.50/11.93 30.50/11.93 30.50/11.93 AST Ident Scanner Information [4 idents]: 30.50/11.93 __VERIFIER_nondet_int | function | [integer, ()] | | 30.50/11.93 main | function | [integer, ()] | 30.50/11.93 i | local variable | integer | | 30.50/11.93 w | local variable | integer | | 30.50/11.93 30.50/11.93 Main function: main 30.50/11.93 Preprocessed LLVMGraph 30.50/11.93 Init Location: 0 30.50/11.93 Transitions: 30.50/11.93 30.50/11.93 30.50/11.93 ((main_i - 1) * ~(1))}> 30.50/11.93 5)), par{main_i -> 0}> 30.50/11.93 0) /\ not((main_i < ~(5))) /\ (main_i > 5), par{main_i -> ((main_i + 1) * ~(1))}> 30.50/11.93 0) /\ not((main_i < ~(5))) /\ not((main_i > 5)), par{main_i -> 0}> 30.50/11.93 30.50/11.93 Fresh variables: 30.50/11.93 undef2, 30.50/11.93 30.50/11.93 Undef variables: 30.50/11.93 undef2, 30.50/11.93 30.50/11.93 Abstraction variables: 30.50/11.93 30.50/11.93 Exit nodes: 30.50/11.93 14, 30.50/11.93 Accepting locations: 30.50/11.93 30.50/11.93 Asserts: 30.50/11.93 30.50/11.93 ************************************************************* 30.50/11.93 ******************************************************************************************* 30.50/11.93 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 30.50/11.93 ******************************************************************************************* 30.50/11.93 30.50/11.93 Init Location: 0 30.50/11.93 Graph 0: 30.50/11.93 Transitions: 30.50/11.93 Variables: 30.50/11.93 30.50/11.93 Graph 1: 30.50/11.93 Transitions: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 0, rest remain the same}> 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 0, rest remain the same}> 30.50/11.93 Variables: 30.50/11.93 main_i 30.50/11.93 30.50/11.93 Graph 2: 30.50/11.93 Transitions: 30.50/11.93 Variables: 30.50/11.93 30.50/11.93 Precedence: 30.50/11.93 Graph 0 30.50/11.93 30.50/11.93 Graph 1 30.50/11.93 30.50/11.93 30.50/11.93 Graph 2 30.50/11.93 30.50/11.93 30.50/11.93 Map Locations to Subgraph: 30.50/11.93 ( 0 , 0 ) 30.50/11.93 ( 2 , 1 ) 30.50/11.93 ( 14 , 2 ) 30.50/11.93 30.50/11.93 ******************************************************************************************* 30.50/11.93 ******************************** CHECKING ASSERTIONS ******************************** 30.50/11.93 ******************************************************************************************* 30.50/11.93 30.50/11.93 Proving termination of subgraph 0 30.50/11.93 Proving termination of subgraph 1 30.50/11.93 Checking unfeasibility... 30.50/11.93 Time used: 0.004699 30.50/11.93 30.50/11.93 Checking conditional termination of SCC {l2}... 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.001277s 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.088798s 30.50/11.93 [14702 : 14704] 30.50/11.93 [14702 : 14705] 30.50/11.93 Successful child: 14704 30.50/11.93 [ Invariant Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 0, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 0, rest remain the same}> 30.50/11.93 [ Termination Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 > It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 0, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 0, rest remain the same}> 30.50/11.93 New Graphs: 30.50/11.93 [14702 : 14709] 30.50/11.93 [14702 : 14710] 30.50/11.93 INVARIANTS: 30.50/11.93 2: 30.50/11.93 Quasi-INVARIANTS to narrow Graph: 30.50/11.93 2: main_i <= 0 , 0 <= main_i , 30.50/11.93 Narrowing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 0, rest remain the same}> 30.50/11.93 Narrowing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 0, rest remain the same}> 30.50/11.93 invGraph after Narrowing: 30.50/11.93 Transitions: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 Variables: 30.50/11.93 main_i 30.50/11.93 Checking conditional termination of SCC {l2}... 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.000711s 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.008632s 30.50/11.93 [14702 : 14711] 30.50/11.93 [14702 : 14712] 30.50/11.93 Successful child: 14711 30.50/11.93 [ Invariant Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 [ Termination Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 > It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 New Graphs: 30.50/11.93 [14702 : 14716] 30.50/11.93 [14702 : 14717] 30.50/11.93 INVARIANTS: 30.50/11.93 2: 30.50/11.93 Quasi-INVARIANTS to narrow Graph: 30.50/11.93 2: 1 <= main_i , main_i <= 1 , 30.50/11.93 Narrowing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 Narrowing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 invGraph after Narrowing: 30.50/11.93 Transitions: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 Variables: 30.50/11.93 main_i 30.50/11.93 Checking conditional termination of SCC {l2}... 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.000736s 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.008677s 30.50/11.93 [14702 : 14718] 30.50/11.93 [14702 : 14719] 30.50/11.93 Successful child: 14718 30.50/11.93 [ Invariant Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 [ Termination Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 New Graphs: 30.50/11.93 [14702 : 14723] 30.50/11.93 [14702 : 14724] 30.50/11.93 INVARIANTS: 30.50/11.93 2: 30.50/11.93 Quasi-INVARIANTS to narrow Graph: 30.50/11.93 2: main_i <= 1 , 0 <= 1 + main_i , 30.50/11.93 Narrowing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 Narrowing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 invGraph after Narrowing: 30.50/11.93 Transitions: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 Variables: 30.50/11.93 main_i 30.50/11.93 Checking conditional termination of SCC {l2}... 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.000722s 30.50/11.93 30.50/11.93 LOG: CALL solveLinear 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear - Elapsed time: 0.008685s 30.50/11.93 [14702 : 14725] 30.50/11.93 [14702 : 14726] 30.50/11.93 Successful child: 14725 30.50/11.93 [ Invariant Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 [ Termination Graph ] 30.50/11.93 Strengthening and disabling transitions... 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: CALL solverLinear in Graph for feasibility 30.50/11.93 30.50/11.93 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.93 It's unfeasible. Removing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.93 New Graphs: 30.50/11.93 [14702 : 14730] 30.50/11.93 [14702 : 14731] 30.50/11.93 INVARIANTS: 30.50/11.93 2: 30.50/11.93 Quasi-INVARIANTS to narrow Graph: 30.50/11.93 2: 1 <= main_i , main_i <= 5 , 30.50/11.93 Narrowing transition: 30.50/11.93 1 - main_i, rest remain the same}> 30.50/11.93 30.50/11.93 LOG: Narrow transition size 2 30.50/11.93 Narrowing transition: 30.50/11.93 -1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 invGraph after Narrowing: 30.50/11.94 Transitions: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 Variables: 30.50/11.94 main_i 30.50/11.94 Checking conditional termination of SCC {l2}... 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.000708s 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.008659s 30.50/11.94 [14702 : 14732] 30.50/11.94 [14702 : 14733] 30.50/11.94 Successful child: 14732 30.50/11.94 [ Invariant Graph ] 30.50/11.94 Strengthening and disabling transitions... 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 [ Termination Graph ] 30.50/11.94 Strengthening and disabling transitions... 30.50/11.94 > It's unfeasible. Removing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 New Graphs: 30.50/11.94 [14702 : 14737] 30.50/11.94 [14702 : 14738] 30.50/11.94 INVARIANTS: 30.50/11.94 2: 30.50/11.94 Quasi-INVARIANTS to narrow Graph: 30.50/11.94 2: 1 + main_i <= 0 , 0 <= 2 + main_i , 30.50/11.94 Narrowing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 Narrowing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 invGraph after Narrowing: 30.50/11.94 Transitions: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 Variables: 30.50/11.94 main_i 30.50/11.94 Checking conditional termination of SCC {l2}... 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.000703s 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.008710s 30.50/11.94 [14702 : 14739] 30.50/11.94 [14702 : 14740] 30.50/11.94 Successful child: 14739 30.50/11.94 [ Invariant Graph ] 30.50/11.94 Strengthening and disabling transitions... 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 [ Termination Graph ] 30.50/11.94 Strengthening and disabling transitions... 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 New Graphs: 30.50/11.94 [14702 : 14744] 30.50/11.94 [14702 : 14745] 30.50/11.94 INVARIANTS: 30.50/11.94 2: 30.50/11.94 Quasi-INVARIANTS to narrow Graph: 30.50/11.94 2: 0 <= 4 + main_i , main_i <= 3 , 30.50/11.94 Narrowing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 Narrowing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 invGraph after Narrowing: 30.50/11.94 Transitions: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 Variables: 30.50/11.94 main_i 30.50/11.94 Checking conditional termination of SCC {l2}... 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.000725s 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.010753s 30.50/11.94 [14702 : 14746] 30.50/11.94 [14702 : 14747] 30.50/11.94 Successful child: 14746 30.50/11.94 [ Invariant Graph ] 30.50/11.94 Strengthening and disabling transitions... 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 [ Termination Graph ] 30.50/11.94 Strengthening and disabling transitions... 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: CALL solverLinear in Graph for feasibility 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear in Graph for feasibility 30.50/11.94 It's unfeasible. Removing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 New Graphs: 30.50/11.94 [14702 : 14751] 30.50/11.94 [14702 : 14752] 30.50/11.94 INVARIANTS: 30.50/11.94 2: 30.50/11.94 Quasi-INVARIANTS to narrow Graph: 30.50/11.94 2: 0 <= 5 + main_i , main_i <= 4 , 30.50/11.94 Narrowing transition: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 Narrowing transition: 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 30.50/11.94 LOG: Narrow transition size 2 30.50/11.94 invGraph after Narrowing: 30.50/11.94 Transitions: 30.50/11.94 1 - main_i, rest remain the same}> 30.50/11.94 -1 - main_i, rest remain the same}> 30.50/11.94 Variables: 30.50/11.94 main_i 30.50/11.94 Checking conditional termination of SCC {l2}... 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.000728s 30.50/11.94 30.50/11.94 LOG: CALL solveLinear 30.50/11.94 30.50/11.94 LOG: RETURN solveLinear - Elapsed time: 0.008691s 30.50/11.94 [14702 : 14753] 30.50/11.94 [14702 : 14754] 30.50/11.94 Solving with 1 template(s). 30.50/11.94 30.50/11.94 LOG: CALL solveNonLinearGetFirstSolution 30.50/11.94 30.50/11.94 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009372s 30.50/11.94 Time used: 0.008976 30.50/11.94 30.50/11.94 [14702 : 14898] 30.50/11.94 [14702 : 14902] 30.50/11.94 Successful child: 14898 30.50/11.94 30.50/11.94 Program does NOT terminate 30.50/11.94 EOF