5.11/5.15 NO 5.11/5.15 5.11/5.15 Solver Timeout: 4 5.11/5.15 Global Timeout: 300 5.11/5.15 No parsing errors! 5.11/5.15 Init Location: 0 5.11/5.15 Transitions: 5.11/5.15 5.11/5.15 1}> 5.11/5.15 undef3}> 5.11/5.15 0}> 5.11/5.15 5.11/5.15 5.11/5.15 5.11/5.15 5.11/5.15 Fresh variables: 5.11/5.15 undef3, 5.11/5.15 5.11/5.15 Undef variables: 5.11/5.15 undef3, 5.11/5.15 5.11/5.15 Abstraction variables: 5.11/5.15 5.11/5.15 Exit nodes: 5.11/5.15 5.11/5.15 Accepting locations: 5.11/5.15 5.11/5.15 Asserts: 5.11/5.15 5.11/5.15 Preprocessed LLVMGraph 5.11/5.15 Init Location: 0 5.11/5.15 Transitions: 5.11/5.15 5.11/5.15 undef3, b^0 -> 0}> 5.11/5.15 5.11/5.15 Fresh variables: 5.11/5.15 undef3, 5.11/5.15 5.11/5.15 Undef variables: 5.11/5.15 undef3, 5.11/5.15 5.11/5.15 Abstraction variables: 5.11/5.15 5.11/5.15 Exit nodes: 5.11/5.15 5.11/5.15 Accepting locations: 5.11/5.15 5.11/5.15 Asserts: 5.11/5.15 5.11/5.15 ************************************************************* 5.11/5.15 ******************************************************************************************* 5.11/5.15 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.11/5.15 ******************************************************************************************* 5.11/5.15 5.11/5.15 Init Location: 0 5.11/5.15 Graph 0: 5.11/5.15 Transitions: 5.11/5.15 Variables: 5.11/5.15 5.11/5.15 Graph 1: 5.11/5.15 Transitions: 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 Variables: 5.11/5.15 __disjvr_0^0, b^0 5.11/5.15 5.11/5.15 Precedence: 5.11/5.15 Graph 0 5.11/5.15 5.11/5.15 Graph 1 5.11/5.15 5.11/5.15 5.11/5.15 Map Locations to Subgraph: 5.11/5.15 ( 0 , 0 ) 5.11/5.15 ( 1 , 1 ) 5.11/5.15 5.11/5.15 ******************************************************************************************* 5.11/5.15 ******************************** CHECKING ASSERTIONS ******************************** 5.11/5.15 ******************************************************************************************* 5.11/5.15 5.11/5.15 Proving termination of subgraph 0 5.11/5.15 Proving termination of subgraph 1 5.11/5.15 Checking unfeasibility... 5.11/5.15 Time used: 0.001884 5.11/5.15 5.11/5.15 Checking conditional termination of SCC {l1}... 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.000536s 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.001642s 5.11/5.15 Trying to remove transition: undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 Solving with 1 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004183s 5.11/5.15 Time used: 0.004029 5.11/5.15 Solving with 1 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006382s 5.11/5.15 Time used: 0.006047 5.11/5.15 Improving Solution with cost 1 ... 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetNextSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011518s 5.11/5.15 Time used: 0.011513 5.11/5.15 5.11/5.15 LOG: SAT solveNonLinear - Elapsed time: 0.017900s 5.11/5.15 Cost: 1; Total time: 0.01756 5.11/5.15 Failed at location 1: 1 + b^0 <= 0 5.11/5.15 Before Improving: 5.11/5.15 Quasi-invariant at l1: 1 + b^0 <= 0 5.11/5.15 Optimizing invariants... 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.002508s 5.11/5.15 Remaining time after improvement: 0.998423 5.11/5.15 Termination implied by a set of quasi-invariant(s): 5.11/5.15 Quasi-invariant at l1: 1 + b^0 <= 0 5.11/5.15 [ Invariant Graph ] 5.11/5.15 Strengthening and disabling transitions... 5.11/5.15 5.11/5.15 LOG: CALL solverLinear in Graph for feasibility 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear in Graph for feasibility 5.11/5.15 It's unfeasible. Removing transition: 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 [ Termination Graph ] 5.11/5.15 Strengthening and disabling transitions... 5.11/5.15 > It's unfeasible. Removing transition: 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 New Graphs: 5.11/5.15 Calling Safety with literal 1 + b^0 <= 0 and entry 5.11/5.15 5.11/5.15 LOG: CALL check - Post:1 + b^0 <= 0 - Process 1 5.11/5.15 * Exit transition: 5.11/5.15 * Postcondition : 1 + b^0 <= 0 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.000312s 5.11/5.15 > Postcondition is not implied! 5.11/5.15 5.11/5.15 LOG: RETURN check - Elapsed time: 0.000374s 5.11/5.15 INVARIANTS: 5.11/5.15 1: 5.11/5.15 Quasi-INVARIANTS to narrow Graph: 5.11/5.15 1: 1 + b^0 <= 0 , 5.11/5.15 Narrowing transition: 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 5.11/5.15 LOG: Narrow transition size 1 5.11/5.15 invGraph after Narrowing: 5.11/5.15 Transitions: 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 Variables: 5.11/5.15 __disjvr_0^0, b^0 5.11/5.15 Checking conditional termination of SCC {l1}... 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.000497s 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.001558s 5.11/5.15 Trying to remove transition: undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 Solving with 1 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003666s 5.11/5.15 Time used: 0.00353 5.11/5.15 Solving with 1 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007236s 5.11/5.15 Time used: 0.006947 5.11/5.15 Solving with 2 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001198s 5.11/5.15 Time used: 4.00036 5.11/5.15 Solving with 3 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004067s 5.11/5.15 Time used: 1.0005 5.11/5.15 Solving with 1 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007365s 5.11/5.15 Time used: 0.004542 5.11/5.15 5.11/5.15 Proving non-termination of subgraph 1 5.11/5.15 Transitions: 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 Variables: 5.11/5.15 __disjvr_0^0, b^0 5.11/5.15 5.11/5.15 Checking that every undef value has an assignment... 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.001045s 5.11/5.15 Checking conditional non-termination of SCC {l1}... 5.11/5.15 EXIT TRANSITIONS: 5.11/5.15 5.11/5.15 5.11/5.15 Solving with 1 template(s). 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017842s 5.11/5.15 Time used: 0.017616 5.11/5.15 Improving Solution with cost 1 ... 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinearGetNextSolution 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027395s 5.11/5.15 Time used: 0.027386 5.11/5.15 5.11/5.15 LOG: SAT solveNonLinear - Elapsed time: 0.045237s 5.11/5.15 Cost: 1; Total time: 0.045002 5.11/5.15 Failed at location 1: 0 <= b^0 5.11/5.15 Before Improving: 5.11/5.15 Quasi-invariant at l1: 0 <= b^0 5.11/5.15 Optimizing invariants... 5.11/5.15 5.11/5.15 LOG: CALL solveLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear - Elapsed time: 0.006985s 5.11/5.15 Remaining time after improvement: 0.99813 5.11/5.15 Minimizing number of undef constraints... 5.11/5.15 5.11/5.15 LOG: CALL solveNonLinear 5.11/5.15 5.11/5.15 LOG: RETURN solveNonLinear - Elapsed time: 0.002290s 5.11/5.15 Number of undef constraints reduced! 5.11/5.15 5.11/5.15 Non-termination implied by a set of quasi-invariant(s): 5.11/5.15 Quasi-invariant at l1: 0 <= b^0 5.11/5.15 5.11/5.15 Strengthening and disabling EXIT transitions... 5.11/5.15 Closed exits from l1: 1 5.11/5.15 5.11/5.15 Strengthening and disabling transitions... 5.11/5.15 5.11/5.15 LOG: CALL solverLinear in Graph for feasibility 5.11/5.15 5.11/5.15 LOG: RETURN solveLinear in Graph for feasibility 5.11/5.15 Strengthening transition (result): 5.11/5.15 undef3, b^0 -> 0, rest remain the same}> 5.11/5.15 5.11/5.15 Calling reachability with... 5.11/5.15 Transition: 5.11/5.15 Conditions: 0 <= b^0, 5.11/5.15 OPEN EXITS: 5.11/5.15 5.11/5.15 5.11/5.15 --- Reachability graph --- 5.11/5.15 > Graph without transitions. 5.11/5.15 5.11/5.15 Calling reachability with... 5.11/5.15 Transition: 5.11/5.15 Conditions: 0 <= b^0, 5.11/5.15 OPEN EXITS: 5.11/5.15 5.11/5.15 5.11/5.15 > Conditions are reachable! 5.11/5.15 5.11/5.15 Program does NOT terminate 5.11/5.15 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.11/5.15 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.11/5.15 EOF