21.57/21.69 NO 21.57/21.69 21.57/21.69 Solver Timeout: 4 21.57/21.69 Global Timeout: 300 21.57/21.69 No parsing errors! 21.57/21.69 Init Location: 0 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 21.57/21.69 undef13}> 21.57/21.69 undef21}> 21.57/21.69 undef26}> 21.57/21.69 (1 + y_6^0)}> 21.57/21.69 21.57/21.69 (1 + x_5^0)}> 21.57/21.69 21.57/21.69 undef65}> 21.57/21.69 undef77}> 21.57/21.69 undef85}> 21.57/21.69 undef91}> 21.57/21.69 (1 + y_6^0)}> 21.57/21.69 (1 + x_5^0)}> 21.57/21.69 undef117}> 21.57/21.69 21.57/21.69 undef133}> 21.57/21.69 undef140}> 21.57/21.69 (1 + y_6^0)}> 21.57/21.69 21.57/21.69 21.57/21.69 Fresh variables: 21.57/21.69 undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 21.57/21.69 21.57/21.69 Undef variables: 21.57/21.69 undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 21.57/21.69 21.57/21.69 Abstraction variables: 21.57/21.69 21.57/21.69 Exit nodes: 21.57/21.69 21.57/21.69 Accepting locations: 21.57/21.69 21.57/21.69 Asserts: 21.57/21.69 21.57/21.69 Preprocessed LLVMGraph 21.57/21.69 Init Location: 0 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 21.57/21.69 undef91, y_6^0 -> (1 + y_6^0)}> 21.57/21.69 (1 + x_5^0)}> 21.57/21.69 21.57/21.69 21.57/21.69 undef26, y_6^0 -> (1 + y_6^0)}> 21.57/21.69 (1 + x_5^0)}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> (1 + y_6^0)}> 21.57/21.69 21.57/21.69 Fresh variables: 21.57/21.69 undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 21.57/21.69 21.57/21.69 Undef variables: 21.57/21.69 undef13, undef21, undef26, undef65, undef77, undef85, undef91, undef117, undef133, undef140, 21.57/21.69 21.57/21.69 Abstraction variables: 21.57/21.69 21.57/21.69 Exit nodes: 21.57/21.69 21.57/21.69 Accepting locations: 21.57/21.69 21.57/21.69 Asserts: 21.57/21.69 21.57/21.69 ************************************************************* 21.57/21.69 ******************************************************************************************* 21.57/21.69 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 21.57/21.69 ******************************************************************************************* 21.57/21.69 21.57/21.69 Init Location: 0 21.57/21.69 Graph 0: 21.57/21.69 Transitions: 21.57/21.69 Variables: 21.57/21.69 21.57/21.69 Graph 1: 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 Variables: 21.57/21.69 x_5^0, y_6^0, z_7^0, __disjvr_1^0, __disjvr_0^0, __disjvr_2^0 21.57/21.69 21.57/21.69 Graph 2: 21.57/21.69 Transitions: 21.57/21.69 Variables: 21.57/21.69 21.57/21.69 Precedence: 21.57/21.69 Graph 0 21.57/21.69 21.57/21.69 Graph 1 21.57/21.69 21.57/21.69 21.57/21.69 Graph 2 21.57/21.69 21.57/21.69 21.57/21.69 Map Locations to Subgraph: 21.57/21.69 ( 0 , 0 ) 21.57/21.69 ( 2 , 1 ) 21.57/21.69 ( 3 , 1 ) 21.57/21.69 ( 4 , 1 ) 21.57/21.69 ( 9 , 2 ) 21.57/21.69 21.57/21.69 ******************************************************************************************* 21.57/21.69 ******************************** CHECKING ASSERTIONS ******************************** 21.57/21.69 ******************************************************************************************* 21.57/21.69 21.57/21.69 Proving termination of subgraph 0 21.57/21.69 Proving termination of subgraph 1 21.57/21.69 Checking unfeasibility... 21.57/21.69 Time used: 0.071373 21.57/21.69 21.57/21.69 Checking conditional termination of SCC {l2, l3, l4}... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.006946s 21.57/21.69 Ranking function: -5 - 2*x_5^0 - y_6^0 + 3*z_7^0 21.57/21.69 New Graphs: 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 Variables: 21.57/21.69 __disjvr_0^0, __disjvr_2^0, x_5^0, y_6^0, z_7^0 21.57/21.69 Checking conditional termination of SCC {l2, l3, l4}... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.002423s 21.57/21.69 Ranking function: -1 - y_6^0 + z_7^0 21.57/21.69 New Graphs: 21.57/21.69 Transitions: 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 Variables: 21.57/21.69 x_5^0, y_6^0, z_7^0 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 Variables: 21.57/21.69 y_6^0, z_7^0 21.57/21.69 Checking conditional termination of SCC {l2}... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.000955s 21.57/21.69 Ranking function: -1 - x_5^0 + y_6^0 21.57/21.69 New Graphs: 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 Variables: 21.57/21.69 y_6^0, z_7^0 21.57/21.69 > No variable changes in termination graph. 21.57/21.69 Checking conditional unfeasibility... 21.57/21.69 Calling Safety with literal z_7^0 <= y_6^0 and entry 21.57/21.69 21.57/21.69 LOG: CALL check - Post:z_7^0 <= y_6^0 - Process 1 21.57/21.69 * Exit transition: 21.57/21.69 * Postcondition : z_7^0 <= y_6^0 21.57/21.69 Quasi-invariants: 21.57/21.69 Location 2: z_7^0 <= y_6^0 ; 21.57/21.69 Location 3: z_7^0 <= y_6^0 ; 21.57/21.69 Location 4: z_7^0 <= y_6^0 ; 21.57/21.69 Postcondition: z_7^0 <= y_6^0 21.57/21.69 21.57/21.69 LOG: CALL check - Post:z_7^0 <= y_6^0 - Process 2 21.57/21.69 * Exit transition: 21.57/21.69 * Postcondition : z_7^0 <= y_6^0 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.000414s 21.57/21.69 > Postcondition is not implied! 21.57/21.69 21.57/21.69 LOG: RETURN check - Elapsed time: 0.000484s 21.57/21.69 21.57/21.69 LOG: NarrowEntry size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 It's unfeasible. Removing transition: 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 It's unfeasible. Removing transition: 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 ENTRIES: 21.57/21.69 21.57/21.69 END ENTRIES: 21.57/21.69 GRAPH: 21.57/21.69 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 END GRAPH: 21.57/21.69 EXIT: 21.57/21.69 POST: z_7^0 <= y_6^0 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Try proving POST 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.056265s 21.57/21.69 Time used: 0.055933 21.57/21.69 Improving Solution with cost 1 ... 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetNextSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062135s 21.57/21.69 Time used: 0.062127 21.57/21.69 21.57/21.69 LOG: SAT solveNonLinear - Elapsed time: 0.118401s 21.57/21.69 Cost: 1; Total time: 0.11806 21.57/21.69 Failed at location 2: z_7^0 <= 1 + x_5^0 21.57/21.69 Before Improving: 21.57/21.69 Quasi-invariant at l2: z_7^0 <= 1 + x_5^0 21.57/21.69 Quasi-invariant at l3: 1 <= 0 21.57/21.69 Quasi-invariant at l4: 1 <= 0 21.57/21.69 Optimizing invariants... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.009630s 21.57/21.69 Remaining time after improvement: 0.997946 21.57/21.69 Postcondition implied by a set of quasi-invariant(s): 21.57/21.69 Quasi-invariant at l2: z_7^0 <= 1 + x_5^0 21.57/21.69 Quasi-invariant at l3: 1 <= 0 21.57/21.69 Quasi-invariant at l4: 1 <= 0 21.57/21.69 Postcondition: z_7^0 <= 1 + x_5^0 21.57/21.69 21.57/21.69 LOG: CALL check - Post:z_7^0 <= 1 + x_5^0 - Process 3 21.57/21.69 * Exit transition: 21.57/21.69 * Postcondition : z_7^0 <= 1 + x_5^0 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.000958s 21.57/21.69 > Postcondition is not implied! 21.57/21.69 21.57/21.69 LOG: RETURN check - Elapsed time: 0.001040s 21.57/21.69 21.57/21.69 LOG: NarrowEntry size 1 21.57/21.69 INVARIANTS: 21.57/21.69 2: 21.57/21.69 3: 21.57/21.69 4: 21.57/21.69 Quasi-INVARIANTS to narrow Graph: 21.57/21.69 2: z_7^0 <= 1 + x_5^0 , 21.57/21.69 3: 1 <= 0 , 21.57/21.69 4: 1 <= 0 , 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 ENTRIES: 21.57/21.69 21.57/21.69 END ENTRIES: 21.57/21.69 GRAPH: 21.57/21.69 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 END GRAPH: 21.57/21.69 EXIT: 21.57/21.69 POST: z_7^0 <= y_6^0 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Try proving POST 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053485s 21.57/21.69 Time used: 0.053116 21.57/21.69 Improving Solution with cost 1 ... 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetNextSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.054403s 21.57/21.69 Time used: 0.054395 21.57/21.69 21.57/21.69 LOG: SAT solveNonLinear - Elapsed time: 0.107888s 21.57/21.69 Cost: 1; Total time: 0.107511 21.57/21.69 Failed at location 2: 1 + y_6^0 <= x_5^0 21.57/21.69 Before Improving: 21.57/21.69 Quasi-invariant at l2: 1 + y_6^0 <= x_5^0 21.57/21.69 Quasi-invariant at l3: z_7^0 <= y_6^0 21.57/21.69 Quasi-invariant at l4: 1 <= 0 21.57/21.69 Optimizing invariants... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.010327s 21.57/21.69 Remaining time after improvement: 0.997516 21.57/21.69 Postcondition implied by a set of quasi-invariant(s): 21.57/21.69 Quasi-invariant at l2: 1 + y_6^0 <= x_5^0 21.57/21.69 Quasi-invariant at l3: z_7^0 <= y_6^0 21.57/21.69 Quasi-invariant at l4: 1 <= 0 21.57/21.69 Postcondition: 1 + y_6^0 <= x_5^0 21.57/21.69 21.57/21.69 LOG: CALL check - Post:1 + y_6^0 <= x_5^0 - Process 4 21.57/21.69 * Exit transition: 21.57/21.69 * Postcondition : 1 + y_6^0 <= x_5^0 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.001018s 21.57/21.69 > Postcondition is not implied! 21.57/21.69 21.57/21.69 LOG: RETURN check - Elapsed time: 0.001120s 21.57/21.69 21.57/21.69 LOG: NarrowEntry size 1 21.57/21.69 INVARIANTS: 21.57/21.69 2: 21.57/21.69 3: 21.57/21.69 4: 21.57/21.69 Quasi-INVARIANTS to narrow Graph: 21.57/21.69 2: 1 + y_6^0 <= x_5^0 , 21.57/21.69 3: z_7^0 <= y_6^0 , 21.57/21.69 4: 1 <= 0 , 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 ENTRIES: 21.57/21.69 21.57/21.69 END ENTRIES: 21.57/21.69 GRAPH: 21.57/21.69 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 END GRAPH: 21.57/21.69 EXIT: 21.57/21.69 POST: z_7^0 <= y_6^0 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Try proving POST 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061706s 21.57/21.69 Time used: 0.061342 21.57/21.69 Improving Solution with cost 1 ... 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetNextSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.077167s 21.57/21.69 Time used: 0.077157 21.57/21.69 21.57/21.69 LOG: SAT solveNonLinear - Elapsed time: 0.138873s 21.57/21.69 Cost: 1; Total time: 0.138499 21.57/21.69 Failed at location 2: y_6^0 <= x_5^0 21.57/21.69 Before Improving: 21.57/21.69 Quasi-invariant at l2: y_6^0 <= x_5^0 21.57/21.69 Quasi-invariant at l3: z_7^0 <= y_6^0 21.57/21.69 Quasi-invariant at l4: 1 <= 0 21.57/21.69 Optimizing invariants... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.010568s 21.57/21.69 Remaining time after improvement: 0.997451 21.57/21.69 Postcondition implied by a set of quasi-invariant(s): 21.57/21.69 Quasi-invariant at l2: y_6^0 <= x_5^0 21.57/21.69 Quasi-invariant at l3: z_7^0 <= y_6^0 21.57/21.69 Quasi-invariant at l4: 1 <= 0 21.57/21.69 Postcondition: y_6^0 <= x_5^0 21.57/21.69 21.57/21.69 LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 5 21.57/21.69 * Exit transition: 21.57/21.69 * Postcondition : y_6^0 <= x_5^0 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.001089s 21.57/21.69 > Postcondition is not implied! 21.57/21.69 21.57/21.69 LOG: RETURN check - Elapsed time: 0.001191s 21.57/21.69 21.57/21.69 LOG: NarrowEntry size 1 21.57/21.69 INVARIANTS: 21.57/21.69 2: 21.57/21.69 3: 21.57/21.69 4: 21.57/21.69 Quasi-INVARIANTS to narrow Graph: 21.57/21.69 2: y_6^0 <= x_5^0 , 21.57/21.69 3: z_7^0 <= y_6^0 , 21.57/21.69 4: 1 <= 0 , 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 Narrowing transition: 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: Narrow transition size 1 21.57/21.69 ENTRIES: 21.57/21.69 21.57/21.69 END ENTRIES: 21.57/21.69 GRAPH: 21.57/21.69 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 END GRAPH: 21.57/21.69 EXIT: 21.57/21.69 POST: z_7^0 <= y_6^0 21.57/21.69 21.57/21.69 21.57/21.69 LOG: Try proving POST 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.129756s 21.57/21.69 Time used: 0.12964 21.57/21.69 Solving with 2 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003784s 21.57/21.69 Time used: 4.00007 21.57/21.69 Solving with 3 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.040381s 21.57/21.69 Time used: 1.00009 21.57/21.69 21.57/21.69 LOG: Postcondition is not implied - no solution 21.57/21.69 > Postcondition is not implied! 21.57/21.69 21.57/21.69 LOG: RETURN check - Elapsed time: 5.643064s 21.57/21.69 21.57/21.69 Proving non-termination of subgraph 1 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 Variables: 21.57/21.69 x_5^0, y_6^0, z_7^0, __disjvr_1^0, __disjvr_0^0, __disjvr_2^0 21.57/21.69 21.57/21.69 Checking that every undef value has an assignment... 21.57/21.69 21.57/21.69 LOG: CALL solveLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear - Elapsed time: 0.002564s 21.57/21.69 Checking conditional non-termination of SCC {l2, l3, l4}... 21.57/21.69 EXIT TRANSITIONS: 21.57/21.69 21.57/21.69 21.57/21.69 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.559859s 21.57/21.69 Time used: 0.558763 21.57/21.69 Improving Solution with cost 1 ... 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetNextSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.136775s 21.57/21.69 Time used: 0.136764 21.57/21.69 21.57/21.69 LOG: SAT solveNonLinear - Elapsed time: 0.696634s 21.57/21.69 Cost: 1; Total time: 0.695527 21.57/21.69 Minimizing number of undef constraints... 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinear - Elapsed time: 0.022266s 21.57/21.69 Number of undef constraints reduced! 21.57/21.69 21.57/21.69 Non-termination implied by a set of quasi-invariant(s): 21.57/21.69 Quasi-invariant at l4: 1 + y_6^0 <= z_7^0 21.57/21.69 21.57/21.69 Strengthening and disabling EXIT transitions... 21.57/21.69 Closed exits from l4: 1 21.57/21.69 Strengthening exit transition (result): 21.57/21.69 21.57/21.69 21.57/21.69 Strengthening and disabling transitions... 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 undef91, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 undef26, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 1 + x_5^0, rest remain the same}> 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 undef140, y_6^0 -> 1 + y_6^0, rest remain the same}> 21.57/21.69 21.57/21.69 Checking conditional non-termination of SCC {l2, l3, l4}... 21.57/21.69 EXIT TRANSITIONS: 21.57/21.69 21.57/21.69 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003069s 21.57/21.69 Time used: 5.00247 21.57/21.69 Solving with 2 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005609s 21.57/21.69 Time used: 5.00008 21.57/21.69 Solving with 3 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.007106s 21.57/21.69 Time used: 5.00004 21.57/21.69 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO 21.57/21.69 21.57/21.69 Proving non-termination of subgraph 1 21.57/21.69 Transitions: 21.57/21.69 21.57/21.69 Variables: 21.57/21.69 y_6^0, z_7^0 21.57/21.69 21.57/21.69 Checking conditional non-termination of SCC {l4}... 21.57/21.69 EXIT TRANSITIONS: 21.57/21.69 21.57/21.69 21.57/21.69 Solving with 1 template(s). 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinearGetFirstSolution 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014085s 21.57/21.69 Time used: 0.013981 21.57/21.69 21.57/21.69 LOG: SAT solveNonLinear - Elapsed time: 0.014085s 21.57/21.69 Cost: 0; Total time: 0.013981 21.57/21.69 Minimizing number of undef constraints... 21.57/21.69 21.57/21.69 LOG: CALL solveNonLinear 21.57/21.69 21.57/21.69 LOG: RETURN solveNonLinear - Elapsed time: 0.003612s 21.57/21.69 Number of undef constraints reduced! 21.57/21.69 21.57/21.69 Non-termination implied by a set of quasi-invariant(s): 21.57/21.69 Quasi-invariant at l4: 1 + y_6^0 <= z_7^0 21.57/21.69 21.57/21.69 Strengthening and disabling EXIT transitions... 21.57/21.69 Closed exits from l4: 1 21.57/21.69 21.57/21.69 Strengthening and disabling transitions... 21.57/21.69 21.57/21.69 LOG: CALL solverLinear in Graph for feasibility 21.57/21.69 21.57/21.69 LOG: RETURN solveLinear in Graph for feasibility 21.57/21.69 Strengthening transition (result): 21.57/21.69 21.57/21.69 21.57/21.69 Calling reachability with... 21.57/21.69 Transition: 21.57/21.69 Conditions: 21.57/21.69 OPEN EXITS: 21.57/21.69 21.57/21.69 21.57/21.69 --- Reachability graph --- 21.57/21.69 > Graph without transitions. 21.57/21.69 21.57/21.69 Calling reachability with... 21.57/21.69 Transition: 21.57/21.69 Conditions: 21.57/21.69 OPEN EXITS: 21.57/21.69 21.57/21.69 21.57/21.69 > Conditions are reachable! 21.57/21.69 21.57/21.69 Program does NOT terminate 21.57/21.69 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 21.57/21.69 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 21.57/21.69 EOF