3.11/3.13 NO 3.11/3.13 3.11/3.13 Solver Timeout: 4 3.11/3.13 Global Timeout: 300 3.11/3.13 No parsing errors! 3.11/3.13 Init Location: 0 3.11/3.13 Transitions: 3.11/3.13 3.11/3.13 3.11/3.13 (1 + i5^0), tmp___08^0 -> undef10}> 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 0, length4^0 -> (0 + undef68), s^0 -> undef68, tmp^0 -> undef69}> 3.11/3.13 3.11/3.13 3.11/3.13 Fresh variables: 3.11/3.13 undef10, undef68, undef69, 3.11/3.13 3.11/3.13 Undef variables: 3.11/3.13 undef10, undef68, undef69, 3.11/3.13 3.11/3.13 Abstraction variables: 3.11/3.13 3.11/3.13 Exit nodes: 3.11/3.13 3.11/3.13 Accepting locations: 3.11/3.13 3.11/3.13 Asserts: 3.11/3.13 3.11/3.13 Preprocessed LLVMGraph 3.11/3.13 Init Location: 0 3.11/3.13 Transitions: 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 (1 + i5^0)}> 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 3.11/3.13 Fresh variables: 3.11/3.13 undef10, undef68, undef69, 3.11/3.13 3.11/3.13 Undef variables: 3.11/3.13 undef10, undef68, undef69, 3.11/3.13 3.11/3.13 Abstraction variables: 3.11/3.13 3.11/3.13 Exit nodes: 3.11/3.13 3.11/3.13 Accepting locations: 3.11/3.13 3.11/3.13 Asserts: 3.11/3.13 3.11/3.13 ************************************************************* 3.11/3.13 ******************************************************************************************* 3.11/3.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 3.11/3.13 ******************************************************************************************* 3.11/3.13 3.11/3.13 Init Location: 0 3.11/3.13 Graph 0: 3.11/3.13 Transitions: 3.11/3.13 Variables: 3.11/3.13 3.11/3.13 Graph 1: 3.11/3.13 Transitions: 3.11/3.13 1 + i5^0, rest remain the same}> 3.11/3.13 Variables: 3.11/3.13 i5^0, length4^0 3.11/3.13 3.11/3.13 Graph 2: 3.11/3.13 Transitions: 3.11/3.13 3.11/3.13 3.11/3.13 Variables: 3.11/3.13 3.11/3.13 Graph 3: 3.11/3.13 Transitions: 3.11/3.13 3.11/3.13 3.11/3.13 Variables: 3.11/3.13 3.11/3.13 Graph 4: 3.11/3.13 Transitions: 3.11/3.13 Variables: 3.11/3.13 3.11/3.13 Precedence: 3.11/3.13 Graph 0 3.11/3.13 3.11/3.13 Graph 1 3.11/3.13 3.11/3.13 3.11/3.13 Graph 2 3.11/3.13 3.11/3.13 3.11/3.13 Graph 3 3.11/3.13 3.11/3.13 3.11/3.13 Graph 4 3.11/3.13 3.11/3.13 3.11/3.13 Map Locations to Subgraph: 3.11/3.13 ( 0 , 0 ) 3.11/3.13 ( 2 , 2 ) 3.11/3.13 ( 3 , 1 ) 3.11/3.13 ( 5 , 3 ) 3.11/3.13 ( 7 , 4 ) 3.11/3.13 3.11/3.13 ******************************************************************************************* 3.11/3.13 ******************************** CHECKING ASSERTIONS ******************************** 3.11/3.13 ******************************************************************************************* 3.11/3.13 3.11/3.13 Proving termination of subgraph 0 3.11/3.13 Proving termination of subgraph 1 3.11/3.13 Checking unfeasibility... 3.11/3.13 Time used: 0.002164 3.11/3.13 3.11/3.13 Checking conditional termination of SCC {l3}... 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.000801s 3.11/3.13 Ranking function: -1 - i5^0 + length4^0 3.11/3.13 New Graphs: 3.11/3.13 Proving termination of subgraph 2 3.11/3.13 Checking unfeasibility... 3.11/3.13 Time used: 0.001805 3.11/3.13 3.11/3.13 > No variable changes in termination graph. 3.11/3.13 Checking conditional unfeasibility... 3.11/3.13 Termination failed. Trying to show unreachability... 3.11/3.13 Proving unreachability of entry: 3.11/3.13 3.11/3.13 LOG: CALL check - Post:1 <= 0 - Process 1 3.11/3.13 * Exit transition: 3.11/3.13 * Postcondition : 1 <= 0 3.11/3.13 Postcodition moved up: 1 <= 0 3.11/3.13 3.11/3.13 LOG: Try proving POST 3.11/3.13 Postcondition: 1 <= 0 3.11/3.13 3.11/3.13 LOG: CALL check - Post:1 <= 0 - Process 2 3.11/3.13 * Exit transition: 3.11/3.13 * Postcondition : 1 <= 0 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.000427s 3.11/3.13 > Postcondition is not implied! 3.11/3.13 3.11/3.13 LOG: RETURN check - Elapsed time: 0.000523s 3.11/3.13 3.11/3.13 LOG: NarrowEntry size 1 3.11/3.13 Narrowing transition: 3.11/3.13 1 + i5^0, rest remain the same}> 3.11/3.13 3.11/3.13 LOG: Narrow transition size 1 3.11/3.13 ENTRIES: 3.11/3.13 3.11/3.13 END ENTRIES: 3.11/3.13 GRAPH: 3.11/3.13 1 + i5^0, rest remain the same}> 3.11/3.13 END GRAPH: 3.11/3.13 EXIT: 3.11/3.13 POST: 1 <= 0 3.11/3.13 3.11/3.13 3.11/3.13 LOG: Try proving POST 3.11/3.13 Solving with 1 template(s). 3.11/3.13 3.11/3.13 LOG: CALL solveNonLinearGetFirstSolution 3.11/3.13 3.11/3.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006982s 3.11/3.13 Time used: 0.006831 3.11/3.13 Improving Solution with cost 51 ... 3.11/3.13 3.11/3.13 LOG: CALL solveNonLinearGetNextSolution 3.11/3.13 3.11/3.13 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.017134s 3.11/3.13 Time used: 1.01687 3.11/3.13 3.11/3.13 LOG: SAT solveNonLinear - Elapsed time: 1.024116s 3.11/3.13 Cost: 51; Total time: 1.0237 3.11/3.13 Failed at location 3: 1 + length4^0 <= i5^0 3.11/3.13 Before Improving: 3.11/3.13 Quasi-invariant at l3: 1 + length4^0 <= i5^0 3.11/3.13 Optimizing invariants... 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.004328s 3.11/3.13 Remaining time after improvement: 0.999145 3.11/3.13 Some transition disabled by a set of quasi-invariant(s): 3.11/3.13 Quasi-invariant at l3: 1 + length4^0 <= i5^0 3.11/3.13 3.11/3.13 LOG: NEXT CALL check - disable 3.11/3.13 3.11/3.13 LOG: CALL check - Post:1 + length4^0 <= i5^0 - Process 3 3.11/3.13 * Exit transition: 3.11/3.13 * Postcondition : 1 + length4^0 <= i5^0 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.000603s 3.11/3.13 > Postcondition is not implied! 3.11/3.13 3.11/3.13 LOG: RETURN check - Elapsed time: 0.000714s 3.11/3.13 Solving with 2 template(s). 3.11/3.13 3.11/3.13 LOG: CALL solveNonLinearGetFirstSolution 3.11/3.13 3.11/3.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029228s 3.11/3.13 Time used: 0.029044 3.11/3.13 Improving Solution with cost 51 ... 3.11/3.13 3.11/3.13 LOG: CALL solveNonLinearGetNextSolution 3.11/3.13 3.11/3.13 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001780s 3.11/3.13 Time used: 1.00168 3.11/3.13 3.11/3.13 LOG: SAT solveNonLinear - Elapsed time: 1.031008s 3.11/3.13 Cost: 51; Total time: 1.03072 3.11/3.13 Failed at location 3: length4^0 <= i5^0 3.11/3.13 Before Improving: 3.11/3.13 Quasi-invariant at l3: length4^0 <= i5^0 3.11/3.13 Optimizing invariants... 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.006100s 3.11/3.13 Remaining time after improvement: 0.998851 3.11/3.13 Some transition disabled by a set of quasi-invariant(s): 3.11/3.13 Quasi-invariant at l3: length4^0 <= i5^0 3.11/3.13 3.11/3.13 LOG: NEXT CALL check - disable 3.11/3.13 3.11/3.13 LOG: CALL check - Post:length4^0 <= i5^0 - Process 4 3.11/3.13 * Exit transition: 3.11/3.13 * Postcondition : length4^0 <= i5^0 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.000719s 3.11/3.13 > Postcondition is not implied! 3.11/3.13 3.11/3.13 LOG: RETURN check - Elapsed time: 0.000831s 3.11/3.13 Solving with 3 template(s). 3.11/3.13 3.11/3.13 LOG: CALL solveNonLinearGetFirstSolution 3.11/3.13 3.11/3.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.113776s 3.11/3.13 Time used: 0.113551 3.11/3.13 Improving Solution with cost 51 ... 3.11/3.13 3.11/3.13 LOG: CALL solveNonLinearGetNextSolution 3.11/3.13 3.11/3.13 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.887079s 3.11/3.13 Time used: 0.886858 3.11/3.13 3.11/3.13 LOG: SAT solveNonLinear - Elapsed time: 1.000855s 3.11/3.13 Cost: 51; Total time: 1.00041 3.11/3.13 Failed at location 3: length4^0 <= 0 3.11/3.13 Before Improving: 3.11/3.13 Quasi-invariant at l3: 0 <= 1 + i5^0 3.11/3.13 Quasi-invariant at l3: 0 <= i5^0 3.11/3.13 Quasi-invariant at l3: length4^0 <= 0 3.11/3.13 Optimizing invariants... 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.008137s 3.11/3.13 Remaining time after improvement: 0.998528 3.11/3.13 Some transition disabled by a set of quasi-invariant(s): 3.11/3.13 Quasi-invariant at l3: 0 <= 1 + i5^0 3.11/3.13 Quasi-invariant at l3: 0 <= i5^0 3.11/3.13 Quasi-invariant at l3: length4^0 <= 0 3.11/3.13 3.11/3.13 LOG: NEXT CALL check - disable 3.11/3.13 3.11/3.13 LOG: CALL check - Post:length4^0 <= 0 - Process 5 3.11/3.13 * Exit transition: 3.11/3.13 * Postcondition : length4^0 <= 0 3.11/3.13 3.11/3.13 LOG: CALL solveLinear 3.11/3.13 3.11/3.13 LOG: RETURN solveLinear - Elapsed time: 0.000743s 3.11/3.13 > Postcondition is not implied! 3.11/3.13 3.11/3.13 LOG: RETURN check - Elapsed time: 0.000845s 3.11/3.13 3.11/3.13 LOG: Postcondition is not implied - no solution 3.11/3.13 > Postcondition is not implied! 3.11/3.13 3.11/3.13 LOG: RETURN check - Elapsed time: 3.085975s 3.11/3.13 Cannot prove unreachability 3.11/3.13 3.11/3.13 Proving non-termination of subgraph 2 3.11/3.13 Transitions: 3.11/3.13 3.11/3.13 3.11/3.13 Variables: 3.11/3.13 3.11/3.13 Checking conditional non-termination of SCC {l2}... 3.11/3.13 > No exit transition to close. 3.11/3.13 Calling reachability with... 3.11/3.13 Transition: 3.11/3.13 Conditions: 3.11/3.13 OPEN EXITS: 3.11/3.13 3.11/3.13 3.11/3.13 --- Reachability graph --- 3.11/3.13 > Graph without transitions. 3.11/3.13 3.11/3.13 Calling reachability with... 3.11/3.13 Transition: 3.11/3.13 Conditions: 3.11/3.13 OPEN EXITS: 3.11/3.13 3.11/3.13 3.11/3.13 --- Reachability graph --- 3.11/3.13 > Graph without transitions. 3.11/3.13 3.11/3.13 Calling reachability with... 3.11/3.13 Transition: 3.11/3.13 Conditions: length4^0 <= i5^0, 3.11/3.13 OPEN EXITS: 3.11/3.13 3.11/3.13 3.11/3.13 > Conditions are reachable! 3.11/3.13 3.11/3.13 Program does NOT terminate 3.11/3.13 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 3.11/3.13 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 3.11/3.13 EOF