3.10/3.12 NO 3.10/3.12 3.10/3.12 Solver Timeout: 4 3.10/3.12 Global Timeout: 300 3.10/3.12 No parsing errors! 3.10/3.12 Init Location: 0 3.10/3.12 Transitions: 3.10/3.12 3.10/3.12 0}> 3.10/3.12 1}> 3.10/3.12 undef12}> 3.10/3.12 (~(2) + x^0)}> 3.10/3.12 (~(1) + x^0)}> 3.10/3.12 3.10/3.12 undef31}> 3.10/3.12 0, start^0 -> 0}> 3.10/3.12 3.10/3.12 3.10/3.12 Fresh variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Undef variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Abstraction variables: 3.10/3.12 3.10/3.12 Exit nodes: 3.10/3.12 3.10/3.12 Accepting locations: 3.10/3.12 3.10/3.12 Asserts: 3.10/3.12 3.10/3.12 Preprocessed LLVMGraph 3.10/3.12 Init Location: 0 3.10/3.12 Transitions: 3.10/3.12 3.10/3.12 3.10/3.12 3.10/3.12 3.10/3.12 (~(2) + x^0)}> 3.10/3.12 (~(1) + x^0)}> 3.10/3.12 3.10/3.12 Fresh variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Undef variables: 3.10/3.12 undef12, undef31, undef41, undef42, 3.10/3.12 3.10/3.12 Abstraction variables: 3.10/3.12 3.10/3.12 Exit nodes: 3.10/3.12 3.10/3.12 Accepting locations: 3.10/3.12 3.10/3.12 Asserts: 3.10/3.12 3.10/3.12 ************************************************************* 3.10/3.12 ******************************************************************************************* 3.10/3.12 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 3.10/3.12 ******************************************************************************************* 3.10/3.12 3.10/3.12 Init Location: 0 3.10/3.12 Graph 0: 3.10/3.12 Transitions: 3.10/3.12 Variables: 3.10/3.12 3.10/3.12 Graph 1: 3.10/3.12 Transitions: 3.10/3.12 -2 + x^0, rest remain the same}> 3.10/3.12 -1 + x^0, rest remain the same}> 3.10/3.12 Variables: 3.10/3.12 x^0 3.10/3.12 3.10/3.12 Graph 2: 3.10/3.12 Transitions: 3.10/3.12 3.10/3.12 3.10/3.12 Variables: 3.10/3.12 3.10/3.12 Precedence: 3.10/3.12 Graph 0 3.10/3.12 3.10/3.12 Graph 1 3.10/3.12 3.10/3.12 3.10/3.12 Graph 2 3.10/3.12 3.10/3.12 3.10/3.12 Map Locations to Subgraph: 3.10/3.12 ( 0 , 0 ) 3.10/3.12 ( 2 , 2 ) 3.10/3.12 ( 4 , 1 ) 3.10/3.12 3.10/3.12 ******************************************************************************************* 3.10/3.12 ******************************** CHECKING ASSERTIONS ******************************** 3.10/3.12 ******************************************************************************************* 3.10/3.12 3.10/3.12 Proving termination of subgraph 0 3.10/3.12 Proving termination of subgraph 1 3.10/3.12 Checking unfeasibility... 3.10/3.12 Time used: 0.002905 3.10/3.12 3.10/3.12 Checking conditional termination of SCC {l4}... 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.001044s 3.10/3.12 Ranking function: -1 + x^0 3.10/3.12 New Graphs: 3.10/3.12 Proving termination of subgraph 2 3.10/3.12 Checking unfeasibility... 3.10/3.12 Time used: 0.001408 3.10/3.12 3.10/3.12 > No variable changes in termination graph. 3.10/3.12 Checking conditional unfeasibility... 3.10/3.12 Termination failed. Trying to show unreachability... 3.10/3.12 Proving unreachability of entry: 3.10/3.12 3.10/3.12 LOG: CALL check - Post:1 <= 0 - Process 1 3.10/3.12 * Exit transition: 3.10/3.12 * Postcondition : 1 <= 0 3.10/3.12 Postcodition moved up: 1 <= 0 3.10/3.12 3.10/3.12 LOG: Try proving POST 3.10/3.12 Postcondition: 1 <= 0 3.10/3.12 3.10/3.12 LOG: CALL check - Post:1 <= 0 - Process 2 3.10/3.12 * Exit transition: 3.10/3.12 * Postcondition : 1 <= 0 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.000320s 3.10/3.12 > Postcondition is not implied! 3.10/3.12 3.10/3.12 LOG: RETURN check - Elapsed time: 0.000394s 3.10/3.12 3.10/3.12 LOG: NarrowEntry size 1 3.10/3.12 Narrowing transition: 3.10/3.12 -2 + x^0, rest remain the same}> 3.10/3.12 3.10/3.12 LOG: Narrow transition size 1 3.10/3.12 Narrowing transition: 3.10/3.12 -1 + x^0, rest remain the same}> 3.10/3.12 3.10/3.12 LOG: Narrow transition size 1 3.10/3.12 ENTRIES: 3.10/3.12 3.10/3.12 END ENTRIES: 3.10/3.12 GRAPH: 3.10/3.12 -2 + x^0, rest remain the same}> 3.10/3.12 -1 + x^0, rest remain the same}> 3.10/3.12 END GRAPH: 3.10/3.12 EXIT: 3.10/3.12 POST: 1 <= 0 3.10/3.12 3.10/3.12 3.10/3.12 LOG: Try proving POST 3.10/3.12 Solving with 1 template(s). 3.10/3.12 3.10/3.12 LOG: CALL solveNonLinearGetFirstSolution 3.10/3.12 3.10/3.12 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005872s 3.10/3.12 Time used: 0.005713 3.10/3.12 Improving Solution with cost 51 ... 3.10/3.12 3.10/3.12 LOG: CALL solveNonLinearGetNextSolution 3.10/3.12 3.10/3.12 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000336s 3.10/3.12 Time used: 1.00027 3.10/3.12 3.10/3.12 LOG: SAT solveNonLinear - Elapsed time: 1.006208s 3.10/3.12 Cost: 51; Total time: 1.00598 3.10/3.12 Failed at location 4: 1 + x^0 <= 0 3.10/3.12 Before Improving: 3.10/3.12 Quasi-invariant at l4: 1 + x^0 <= 0 3.10/3.12 Optimizing invariants... 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.003424s 3.10/3.12 Remaining time after improvement: 0.998717 3.10/3.12 Some transition disabled by a set of quasi-invariant(s): 3.10/3.12 Quasi-invariant at l4: 1 + x^0 <= 0 3.10/3.12 3.10/3.12 LOG: NEXT CALL check - disable 3.10/3.12 3.10/3.12 LOG: CALL check - Post:1 + x^0 <= 0 - Process 3 3.10/3.12 * Exit transition: 3.10/3.12 * Postcondition : 1 + x^0 <= 0 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.000510s 3.10/3.12 > Postcondition is not implied! 3.10/3.12 3.10/3.12 LOG: RETURN check - Elapsed time: 0.000596s 3.10/3.12 Solving with 2 template(s). 3.10/3.12 3.10/3.12 LOG: CALL solveNonLinearGetFirstSolution 3.10/3.12 3.10/3.12 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021842s 3.10/3.12 Time used: 0.021641 3.10/3.12 Improving Solution with cost 51 ... 3.10/3.12 3.10/3.12 LOG: CALL solveNonLinearGetNextSolution 3.10/3.12 3.10/3.12 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000442s 3.10/3.12 Time used: 1.00039 3.10/3.12 3.10/3.12 LOG: SAT solveNonLinear - Elapsed time: 1.022283s 3.10/3.12 Cost: 51; Total time: 1.02203 3.10/3.12 Failed at location 4: x^0 <= 0 3.10/3.12 Before Improving: 3.10/3.12 Quasi-invariant at l4: x^0 <= 0 3.10/3.12 Optimizing invariants... 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.011196s 3.10/3.12 Remaining time after improvement: 0.998588 3.10/3.12 Some transition disabled by a set of quasi-invariant(s): 3.10/3.12 Quasi-invariant at l4: x^0 <= 0 3.10/3.12 3.10/3.12 LOG: NEXT CALL check - disable 3.10/3.12 3.10/3.12 LOG: CALL check - Post:x^0 <= 0 - Process 4 3.10/3.12 * Exit transition: 3.10/3.12 * Postcondition : x^0 <= 0 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.000623s 3.10/3.12 > Postcondition is not implied! 3.10/3.12 3.10/3.12 LOG: RETURN check - Elapsed time: 0.000709s 3.10/3.12 Solving with 3 template(s). 3.10/3.12 3.10/3.12 LOG: CALL solveNonLinearGetFirstSolution 3.10/3.12 3.10/3.12 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061736s 3.10/3.12 Time used: 0.061466 3.10/3.12 Improving Solution with cost 51 ... 3.10/3.12 3.10/3.12 LOG: CALL solveNonLinearGetNextSolution 3.10/3.12 3.10/3.12 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.939406s 3.10/3.12 Time used: 0.939346 3.10/3.12 3.10/3.12 LOG: SAT solveNonLinear - Elapsed time: 1.001142s 3.10/3.12 Cost: 51; Total time: 1.00081 3.10/3.12 Failed at location 4: x^0 <= 0 3.10/3.12 Before Improving: 3.10/3.12 Quasi-invariant at l4: x^0 <= 0 3.10/3.12 Optimizing invariants... 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.014551s 3.10/3.12 Remaining time after improvement: 0.997775 3.10/3.12 Some transition disabled by a set of quasi-invariant(s): 3.10/3.12 Quasi-invariant at l4: x^0 <= 0 3.10/3.12 3.10/3.12 LOG: NEXT CALL check - disable 3.10/3.12 3.10/3.12 LOG: CALL check - Post:x^0 <= 0 - Process 5 3.10/3.12 * Exit transition: 3.10/3.12 * Postcondition : x^0 <= 0 3.10/3.12 3.10/3.12 LOG: CALL solveLinear 3.10/3.12 3.10/3.12 LOG: RETURN solveLinear - Elapsed time: 0.000732s 3.10/3.12 > Postcondition is not implied! 3.10/3.12 3.10/3.12 LOG: RETURN check - Elapsed time: 0.000822s 3.10/3.12 3.10/3.12 LOG: Postcondition is not implied - no solution 3.10/3.12 > Postcondition is not implied! 3.10/3.12 3.10/3.12 LOG: RETURN check - Elapsed time: 3.070725s 3.10/3.12 Cannot prove unreachability 3.10/3.12 3.10/3.12 Proving non-termination of subgraph 2 3.10/3.12 Transitions: 3.10/3.12 3.10/3.12 3.10/3.12 Variables: 3.10/3.12 3.10/3.12 Checking conditional non-termination of SCC {l2}... 3.10/3.12 > No exit transition to close. 3.10/3.12 Calling reachability with... 3.10/3.12 Transition: 3.10/3.12 Conditions: 3.10/3.12 OPEN EXITS: 3.10/3.12 3.10/3.12 3.10/3.12 --- Reachability graph --- 3.10/3.12 > Graph without transitions. 3.10/3.12 3.10/3.12 Calling reachability with... 3.10/3.12 Transition: 3.10/3.12 Conditions: 3.10/3.12 OPEN EXITS: 3.10/3.12 3.10/3.12 3.10/3.12 --- Reachability graph --- 3.10/3.12 > Graph without transitions. 3.10/3.12 3.10/3.12 Calling reachability with... 3.10/3.12 Transition: 3.10/3.12 Conditions: x^0 <= 0, 3.10/3.12 OPEN EXITS: 3.10/3.12 3.10/3.12 3.10/3.12 > Conditions are reachable! 3.10/3.12 3.10/3.12 Program does NOT terminate 3.10/3.12 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 3.10/3.12 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 3.10/3.12 EOF