NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0}> (~(1) + y_1^0)}> ~(1)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + y_1^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + y_1^0, rest remain the same}> Variables: y_1^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001388 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000505s Ranking function: -1 + y_1^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.000845 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000162s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000214s LOG: NarrowEntry size 1 Narrowing transition: -1 + y_1^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: -1 + y_1^0, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004356s Time used: 0.004221 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000263s Time used: 1.0003 LOG: SAT solveNonLinear - Elapsed time: 1.004619s Cost: 51; Total time: 1.00452 Failed at location 4: y_1^0 <= 0 Before Improving: Quasi-invariant at l4: y_1^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008412s Remaining time after improvement: 0.99921 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l4: y_1^0 <= 0 LOG: NEXT CALL check - disable LOG: CALL check - Post:y_1^0 <= 0 - Process 3 * Exit transition: * Postcondition : y_1^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000376s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000461s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014186s Time used: 0.014038 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000670s Time used: 1.00069 LOG: SAT solveNonLinear - Elapsed time: 1.014856s Cost: 51; Total time: 1.01473 Failed at location 4: y_1^0 <= 0 Before Improving: Quasi-invariant at l4: y_1^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004772s Remaining time after improvement: 0.999096 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l4: y_1^0 <= 0 LOG: NEXT CALL check - disable LOG: CALL check - Post:y_1^0 <= 0 - Process 4 * Exit transition: * Postcondition : y_1^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000417s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000484s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040695s Time used: 0.04053 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.959757s Time used: 0.959781 LOG: SAT solveNonLinear - Elapsed time: 1.000452s Cost: 51; Total time: 1.00031 Failed at location 4: y_1^0 <= 0 Before Improving: Quasi-invariant at l4: y_1^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006400s Remaining time after improvement: 0.99894 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l4: y_1^0 <= 0 LOG: NEXT CALL check - disable LOG: CALL check - Post:y_1^0 <= 0 - Process 5 * Exit transition: * Postcondition : y_1^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000430s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000497s LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.246208s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: Variables: Checking conditional non-termination of SCC {l1}... > No exit transition to close. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: y_1^0 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate