5.29/5.37 NO 5.29/5.37 5.29/5.37 Solver Timeout: 4 5.29/5.37 Global Timeout: 300 5.29/5.37 No parsing errors! 5.29/5.37 Init Location: 0 5.29/5.37 Transitions: 5.29/5.37 5.29/5.37 undef3}> 5.29/5.37 5.29/5.37 5.29/5.37 5.29/5.37 5.29/5.37 Fresh variables: 5.29/5.37 undef3, 5.29/5.37 5.29/5.37 Undef variables: 5.29/5.37 undef3, 5.29/5.37 5.29/5.37 Abstraction variables: 5.29/5.37 5.29/5.37 Exit nodes: 5.29/5.37 5.29/5.37 Accepting locations: 5.29/5.37 5.29/5.37 Asserts: 5.29/5.37 5.29/5.37 Preprocessed LLVMGraph 5.29/5.37 Init Location: 0 5.29/5.37 Transitions: 5.29/5.37 5.29/5.37 undef3}> 5.29/5.37 5.29/5.37 Fresh variables: 5.29/5.37 undef3, 5.29/5.37 5.29/5.37 Undef variables: 5.29/5.37 undef3, 5.29/5.37 5.29/5.37 Abstraction variables: 5.29/5.37 5.29/5.37 Exit nodes: 5.29/5.37 5.29/5.37 Accepting locations: 5.29/5.37 5.29/5.37 Asserts: 5.29/5.37 5.29/5.37 ************************************************************* 5.29/5.37 ******************************************************************************************* 5.29/5.37 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.29/5.37 ******************************************************************************************* 5.29/5.37 5.29/5.37 Init Location: 0 5.29/5.37 Graph 0: 5.29/5.37 Transitions: 5.29/5.37 Variables: 5.29/5.37 5.29/5.37 Graph 1: 5.29/5.37 Transitions: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 Variables: 5.29/5.37 __const_1000^0, __const_200^0, x^0 5.29/5.37 5.29/5.37 Precedence: 5.29/5.37 Graph 0 5.29/5.37 5.29/5.37 Graph 1 5.29/5.37 5.29/5.37 5.29/5.37 Map Locations to Subgraph: 5.29/5.37 ( 0 , 0 ) 5.29/5.37 ( 1 , 1 ) 5.29/5.37 5.29/5.37 ******************************************************************************************* 5.29/5.37 ******************************** CHECKING ASSERTIONS ******************************** 5.29/5.37 ******************************************************************************************* 5.29/5.37 5.29/5.37 Proving termination of subgraph 0 5.29/5.37 Proving termination of subgraph 1 5.29/5.37 Checking unfeasibility... 5.29/5.37 Time used: 0.002296 5.29/5.37 5.29/5.37 Checking conditional termination of SCC {l1}... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000875s 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002558s 5.29/5.37 Trying to remove transition: undef3, rest remain the same}> 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006839s 5.29/5.37 Time used: 0.006684 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009142s 5.29/5.37 Time used: 0.008631 5.29/5.37 Improving Solution with cost 1 ... 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetNextSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015354s 5.29/5.37 Time used: 0.015349 5.29/5.37 5.29/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.024496s 5.29/5.37 Cost: 1; Total time: 0.02398 5.29/5.37 Failed at location 1: 1 <= __const_1000^0 5.29/5.37 Before Improving: 5.29/5.37 Quasi-invariant at l1: 1 <= __const_1000^0 5.29/5.37 Optimizing invariants... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002801s 5.29/5.37 Remaining time after improvement: 0.99847 5.29/5.37 Termination implied by a set of quasi-invariant(s): 5.29/5.37 Quasi-invariant at l1: 1 <= __const_1000^0 5.29/5.37 [ Invariant Graph ] 5.29/5.37 Strengthening and disabling transitions... 5.29/5.37 5.29/5.37 LOG: CALL solverLinear in Graph for feasibility 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.37 Strengthening transition (result): 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 [ Termination Graph ] 5.29/5.37 Strengthening and disabling transitions... 5.29/5.37 5.29/5.37 LOG: CALL solverLinear in Graph for feasibility 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.37 Strengthening transition (result): 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 Ranking function: -__const_1000^0 - __const_200^0 + x^0 5.29/5.37 New Graphs: 5.29/5.37 Calling Safety with literal 1 <= __const_1000^0 and entry 5.29/5.37 5.29/5.37 LOG: CALL check - Post:1 <= __const_1000^0 - Process 1 5.29/5.37 * Exit transition: 5.29/5.37 * Postcondition : 1 <= __const_1000^0 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000301s 5.29/5.37 > Postcondition is not implied! 5.29/5.37 5.29/5.37 LOG: RETURN check - Elapsed time: 0.000385s 5.29/5.37 INVARIANTS: 5.29/5.37 1: 5.29/5.37 Quasi-INVARIANTS to narrow Graph: 5.29/5.37 1: 1 <= __const_1000^0 , 5.29/5.37 Narrowing transition: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 5.29/5.37 LOG: Narrow transition size 1 5.29/5.37 invGraph after Narrowing: 5.29/5.37 Transitions: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 Variables: 5.29/5.37 __const_1000^0, __const_200^0, x^0 5.29/5.37 Checking conditional termination of SCC {l1}... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000662s 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002424s 5.29/5.37 Trying to remove transition: undef3, rest remain the same}> 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006242s 5.29/5.37 Time used: 0.006076 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012226s 5.29/5.37 Time used: 0.011697 5.29/5.37 Improving Solution with cost 1 ... 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetNextSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013131s 5.29/5.37 Time used: 0.013127 5.29/5.37 5.29/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.025357s 5.29/5.37 Cost: 1; Total time: 0.024824 5.29/5.37 Failed at location 1: x^0 <= __const_1000^0 + __const_200^0 5.29/5.37 Before Improving: 5.29/5.37 Quasi-invariant at l1: x^0 <= __const_1000^0 + __const_200^0 5.29/5.37 Optimizing invariants... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002386s 5.29/5.37 Remaining time after improvement: 0.998821 5.29/5.37 Termination implied by a set of quasi-invariant(s): 5.29/5.37 Quasi-invariant at l1: x^0 <= __const_1000^0 + __const_200^0 5.29/5.37 [ Invariant Graph ] 5.29/5.37 Strengthening and disabling transitions... 5.29/5.37 5.29/5.37 LOG: CALL solverLinear in Graph for feasibility 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.37 It's unfeasible. Removing transition: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 [ Termination Graph ] 5.29/5.37 Strengthening and disabling transitions... 5.29/5.37 > It's unfeasible. Removing transition: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 New Graphs: 5.29/5.37 Calling Safety with literal x^0 <= __const_1000^0 + __const_200^0 and entry 5.29/5.37 5.29/5.37 LOG: CALL check - Post:x^0 <= __const_1000^0 + __const_200^0 - Process 2 5.29/5.37 * Exit transition: 5.29/5.37 * Postcondition : x^0 <= __const_1000^0 + __const_200^0 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000491s 5.29/5.37 > Postcondition is not implied! 5.29/5.37 5.29/5.37 LOG: RETURN check - Elapsed time: 0.000578s 5.29/5.37 INVARIANTS: 5.29/5.37 1: 5.29/5.37 Quasi-INVARIANTS to narrow Graph: 5.29/5.37 1: x^0 <= __const_1000^0 + __const_200^0 , 5.29/5.37 Narrowing transition: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 5.29/5.37 LOG: Narrow transition size 1 5.29/5.37 invGraph after Narrowing: 5.29/5.37 Transitions: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 Variables: 5.29/5.37 __const_1000^0, __const_200^0, x^0 5.29/5.37 Checking conditional termination of SCC {l1}... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000716s 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.002776s 5.29/5.37 Trying to remove transition: undef3, rest remain the same}> 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005832s 5.29/5.37 Time used: 0.005657 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011748s 5.29/5.37 Time used: 0.011313 5.29/5.37 Solving with 2 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001393s 5.29/5.37 Time used: 4.00047 5.29/5.37 Solving with 3 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002953s 5.29/5.37 Time used: 1.00018 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015083s 5.29/5.37 Time used: 0.007962 5.29/5.37 5.29/5.37 Proving non-termination of subgraph 1 5.29/5.37 Transitions: 5.29/5.37 undef3, rest remain the same}> 5.29/5.37 Variables: 5.29/5.37 __const_1000^0, __const_200^0, x^0 5.29/5.37 5.29/5.37 Checking that every undef value has an assignment... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.001297s 5.29/5.37 Checking conditional non-termination of SCC {l1}... 5.29/5.37 EXIT TRANSITIONS: 5.29/5.37 5.29/5.37 5.29/5.37 5.29/5.37 Solving with 1 template(s). 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022395s 5.29/5.37 Time used: 0.022091 5.29/5.37 Improving Solution with cost 2 ... 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinearGetNextSolution 5.29/5.37 5.29/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066758s 5.29/5.37 Time used: 0.066751 5.29/5.37 5.29/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.089152s 5.29/5.37 Cost: 2; Total time: 0.088842 5.29/5.37 Failed at location 1: 1 + __const_1000^0 <= 0 5.29/5.37 Before Improving: 5.29/5.37 Quasi-invariant at l1: 1 + __const_1000^0 <= 0 5.29/5.37 Optimizing invariants... 5.29/5.37 5.29/5.37 LOG: CALL solveLinear 5.29/5.37 5.29/5.37 LOG: RETURN solveLinear - Elapsed time: 0.009809s 5.29/5.37 Remaining time after improvement: 0.998066 5.29/5.37 Minimizing number of undef constraints... 5.29/5.37 5.29/5.37 LOG: CALL solveNonLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinear - Elapsed time: 0.003475s 5.29/5.38 Number of undef constraints reduced! 5.29/5.38 5.29/5.38 Non-termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l1: 1 + __const_1000^0 <= 0 5.29/5.38 5.29/5.38 Strengthening and disabling EXIT transitions... 5.29/5.38 Closed exits from l1: 1 5.29/5.38 Strengthening exit transition (result): 5.29/5.38 5.29/5.38 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef3, rest remain the same}> 5.29/5.38 5.29/5.38 Checking conditional non-termination of SCC {l1}... 5.29/5.38 EXIT TRANSITIONS: 5.29/5.38 5.29/5.38 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016667s 5.29/5.38 Time used: 0.016382 5.29/5.38 Improving Solution with cost 1 ... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetNextSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028187s 5.29/5.38 Time used: 0.028181 5.29/5.38 5.29/5.38 LOG: SAT solveNonLinear - Elapsed time: 0.044854s 5.29/5.38 Cost: 1; Total time: 0.044563 5.29/5.38 Failed at location 1: __const_200^0 <= 1 + __const_1000^0 + x^0 5.29/5.38 Before Improving: 5.29/5.38 Quasi-invariant at l1: __const_200^0 <= 1 + __const_1000^0 + x^0 5.29/5.38 Optimizing invariants... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.009617s 5.29/5.38 Remaining time after improvement: 0.997973 5.29/5.38 Minimizing number of undef constraints... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinear - Elapsed time: 0.003375s 5.29/5.38 Number of undef constraints reduced! 5.29/5.38 5.29/5.38 Non-termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l1: __const_200^0 <= 1 + __const_1000^0 + x^0 5.29/5.38 5.29/5.38 Strengthening and disabling EXIT transitions... 5.29/5.38 Closed exits from l1: 1 5.29/5.38 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef3, rest remain the same}> 5.29/5.38 5.29/5.38 Calling reachability with... 5.29/5.38 Transition: 5.29/5.38 Conditions: 1 + __const_1000^0 <= 0, __const_200^0 <= 1 + __const_1000^0 + x^0, 5.29/5.38 OPEN EXITS: 5.29/5.38 (condsUp: 1 + __const_1000^0 <= 0) 5.29/5.38 5.29/5.38 --- Reachability graph --- 5.29/5.38 > Graph without transitions. 5.29/5.38 5.29/5.38 Calling reachability with... 5.29/5.38 Transition: 5.29/5.38 Conditions: __const_200^0 <= 1 + __const_1000^0 + x^0, 1 + __const_1000^0 <= 0, 5.29/5.38 OPEN EXITS: 5.29/5.38 5.29/5.38 5.29/5.38 > Conditions are reachable! 5.29/5.38 5.29/5.38 Program does NOT terminate 5.29/5.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.29/5.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.29/5.38 EOF