0.00/0.18 NO 0.00/0.18 0.00/0.18 Solver Timeout: 4 0.00/0.18 Global Timeout: 300 0.00/0.18 No parsing errors! 0.00/0.18 Init Location: 0 0.00/0.18 Transitions: 0.00/0.18 0.00/0.18 (1 + (~(1) * x^0))}> 0.00/0.18 0.00/0.18 0.00/0.18 0.00/0.18 0.00/0.18 Fresh variables: 0.00/0.18 0.00/0.18 Undef variables: 0.00/0.18 0.00/0.18 Abstraction variables: 0.00/0.18 0.00/0.18 Exit nodes: 0.00/0.18 0.00/0.18 Accepting locations: 0.00/0.18 0.00/0.18 Asserts: 0.00/0.18 0.00/0.18 Preprocessed LLVMGraph 0.00/0.18 Init Location: 0 0.00/0.18 Transitions: 0.00/0.18 0.00/0.18 (1 + (~(1) * x^0))}> 0.00/0.18 0.00/0.18 Fresh variables: 0.00/0.18 0.00/0.18 Undef variables: 0.00/0.18 0.00/0.18 Abstraction variables: 0.00/0.18 0.00/0.18 Exit nodes: 0.00/0.18 0.00/0.18 Accepting locations: 0.00/0.18 0.00/0.18 Asserts: 0.00/0.18 0.00/0.18 ************************************************************* 0.00/0.18 ******************************************************************************************* 0.00/0.18 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.18 ******************************************************************************************* 0.00/0.18 0.00/0.18 Init Location: 0 0.00/0.18 Graph 0: 0.00/0.18 Transitions: 0.00/0.18 Variables: 0.00/0.18 0.00/0.18 Graph 1: 0.00/0.18 Transitions: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 Variables: 0.00/0.18 x^0 0.00/0.18 0.00/0.18 Precedence: 0.00/0.18 Graph 0 0.00/0.18 0.00/0.18 Graph 1 0.00/0.18 0.00/0.18 0.00/0.18 Map Locations to Subgraph: 0.00/0.18 ( 0 , 0 ) 0.00/0.18 ( 1 , 1 ) 0.00/0.18 0.00/0.18 ******************************************************************************************* 0.00/0.18 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.18 ******************************************************************************************* 0.00/0.18 0.00/0.18 Proving termination of subgraph 0 0.00/0.18 Proving termination of subgraph 1 0.00/0.18 Checking unfeasibility... 0.00/0.18 Time used: 0.001467 0.00/0.18 0.00/0.18 Checking conditional termination of SCC {l1}... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.000497s 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001486s 0.00/0.18 Trying to remove transition: 1 - x^0, rest remain the same}> 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003584s 0.00/0.18 Time used: 0.003458 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004125s 0.00/0.18 Time used: 0.003888 0.00/0.18 Improving Solution with cost 1 ... 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetNextSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010989s 0.00/0.18 Time used: 0.010985 0.00/0.18 0.00/0.18 LOG: SAT solveNonLinear - Elapsed time: 0.015114s 0.00/0.18 Cost: 1; Total time: 0.014873 0.00/0.18 Failed at location 1: 1 + x^0 <= 0 0.00/0.18 Before Improving: 0.00/0.18 Quasi-invariant at l1: 1 + x^0 <= 0 0.00/0.18 Optimizing invariants... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001456s 0.00/0.18 Remaining time after improvement: 0.999273 0.00/0.18 Termination implied by a set of quasi-invariant(s): 0.00/0.18 Quasi-invariant at l1: 1 + x^0 <= 0 0.00/0.18 [ Invariant Graph ] 0.00/0.18 Strengthening and disabling transitions... 0.00/0.18 0.00/0.18 LOG: CALL solverLinear in Graph for feasibility 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.18 It's unfeasible. Removing transition: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 [ Termination Graph ] 0.00/0.18 Strengthening and disabling transitions... 0.00/0.18 0.00/0.18 LOG: CALL solverLinear in Graph for feasibility 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.18 It's unfeasible. Removing transition: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 New Graphs: 0.00/0.18 Calling Safety with literal 1 + x^0 <= 0 and entry 0.00/0.18 0.00/0.18 LOG: CALL check - Post:1 + x^0 <= 0 - Process 1 0.00/0.18 * Exit transition: 0.00/0.18 * Postcondition : 1 + x^0 <= 0 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.000269s 0.00/0.18 > Postcondition is not implied! 0.00/0.18 0.00/0.18 LOG: RETURN check - Elapsed time: 0.000330s 0.00/0.18 INVARIANTS: 0.00/0.18 1: 0.00/0.18 Quasi-INVARIANTS to narrow Graph: 0.00/0.18 1: 1 + x^0 <= 0 , 0.00/0.18 Narrowing transition: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 0.00/0.18 LOG: Narrow transition size 1 0.00/0.18 invGraph after Narrowing: 0.00/0.18 Transitions: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 Variables: 0.00/0.18 x^0 0.00/0.18 Checking conditional termination of SCC {l1}... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.000460s 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001414s 0.00/0.18 Trying to remove transition: 1 - x^0, rest remain the same}> 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003206s 0.00/0.18 Time used: 0.003076 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008713s 0.00/0.18 Time used: 0.008445 0.00/0.18 Improving Solution with cost 1 ... 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetNextSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007295s 0.00/0.18 Time used: 0.00729 0.00/0.18 0.00/0.18 LOG: SAT solveNonLinear - Elapsed time: 0.016008s 0.00/0.18 Cost: 1; Total time: 0.015735 0.00/0.18 Failed at location 1: 2 <= x^0 0.00/0.18 Before Improving: 0.00/0.18 Quasi-invariant at l1: 2 <= x^0 0.00/0.18 Optimizing invariants... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001499s 0.00/0.18 Remaining time after improvement: 0.999241 0.00/0.18 Termination implied by a set of quasi-invariant(s): 0.00/0.18 Quasi-invariant at l1: 2 <= x^0 0.00/0.18 [ Invariant Graph ] 0.00/0.18 Strengthening and disabling transitions... 0.00/0.18 0.00/0.18 LOG: CALL solverLinear in Graph for feasibility 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.18 It's unfeasible. Removing transition: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 [ Termination Graph ] 0.00/0.18 Strengthening and disabling transitions... 0.00/0.18 > It's unfeasible. Removing transition: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 New Graphs: 0.00/0.18 Calling Safety with literal 2 <= x^0 and entry 0.00/0.18 0.00/0.18 LOG: CALL check - Post:2 <= x^0 - Process 2 0.00/0.18 * Exit transition: 0.00/0.18 * Postcondition : 2 <= x^0 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.000318s 0.00/0.18 > Postcondition is not implied! 0.00/0.18 0.00/0.18 LOG: RETURN check - Elapsed time: 0.000385s 0.00/0.18 INVARIANTS: 0.00/0.18 1: 0.00/0.18 Quasi-INVARIANTS to narrow Graph: 0.00/0.18 1: 2 <= x^0 , 0.00/0.18 Narrowing transition: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 0.00/0.18 LOG: Narrow transition size 1 0.00/0.18 invGraph after Narrowing: 0.00/0.18 Transitions: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 Variables: 0.00/0.18 x^0 0.00/0.18 Checking conditional termination of SCC {l1}... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.000454s 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001417s 0.00/0.18 Trying to remove transition: 1 - x^0, rest remain the same}> 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003174s 0.00/0.18 Time used: 0.003044 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003946s 0.00/0.18 Time used: 0.00377 0.00/0.18 Solving with 2 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014564s 0.00/0.18 Time used: 0.014376 0.00/0.18 Solving with 3 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050351s 0.00/0.18 Time used: 0.049921 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004873s 0.00/0.18 Time used: 0.003606 0.00/0.18 0.00/0.18 Proving non-termination of subgraph 1 0.00/0.18 Transitions: 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 Variables: 0.00/0.18 x^0 0.00/0.18 0.00/0.18 Checking conditional non-termination of SCC {l1}... 0.00/0.18 EXIT TRANSITIONS: 0.00/0.18 0.00/0.18 0.00/0.18 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003901s 0.00/0.18 Time used: 0.003753 0.00/0.18 Improving Solution with cost 2 ... 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetNextSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005883s 0.00/0.18 Time used: 0.005878 0.00/0.18 0.00/0.18 LOG: SAT solveNonLinear - Elapsed time: 0.009783s 0.00/0.18 Cost: 2; Total time: 0.009631 0.00/0.18 Failed at location 1: x^0 <= 1 0.00/0.18 Before Improving: 0.00/0.18 Quasi-invariant at l1: x^0 <= 1 0.00/0.18 Optimizing invariants... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001240s 0.00/0.18 Remaining time after improvement: 0.999254 0.00/0.18 Non-termination implied by a set of quasi-invariant(s): 0.00/0.18 Quasi-invariant at l1: x^0 <= 1 0.00/0.18 0.00/0.18 Strengthening and disabling EXIT transitions... 0.00/0.18 Closed exits from l1: 1 0.00/0.18 Strengthening exit transition (result): 0.00/0.18 0.00/0.18 0.00/0.18 Strengthening and disabling transitions... 0.00/0.18 0.00/0.18 LOG: CALL solverLinear in Graph for feasibility 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.18 Strengthening transition (result): 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 0.00/0.18 Checking conditional non-termination of SCC {l1}... 0.00/0.18 EXIT TRANSITIONS: 0.00/0.18 0.00/0.18 0.00/0.18 Solving with 1 template(s). 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002925s 0.00/0.18 Time used: 0.002779 0.00/0.18 Improving Solution with cost 1 ... 0.00/0.18 0.00/0.18 LOG: CALL solveNonLinearGetNextSolution 0.00/0.18 0.00/0.18 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003622s 0.00/0.18 Time used: 0.003618 0.00/0.18 0.00/0.18 LOG: SAT solveNonLinear - Elapsed time: 0.006547s 0.00/0.18 Cost: 1; Total time: 0.006397 0.00/0.18 Failed at location 1: 0 <= x^0 0.00/0.18 Before Improving: 0.00/0.18 Quasi-invariant at l1: 0 <= x^0 0.00/0.18 Optimizing invariants... 0.00/0.18 0.00/0.18 LOG: CALL solveLinear 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear - Elapsed time: 0.001089s 0.00/0.18 Remaining time after improvement: 0.999322 0.00/0.18 Non-termination implied by a set of quasi-invariant(s): 0.00/0.18 Quasi-invariant at l1: 0 <= x^0 0.00/0.18 0.00/0.18 Strengthening and disabling EXIT transitions... 0.00/0.18 Closed exits from l1: 1 0.00/0.18 0.00/0.18 Strengthening and disabling transitions... 0.00/0.18 0.00/0.18 LOG: CALL solverLinear in Graph for feasibility 0.00/0.18 0.00/0.18 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.18 Strengthening transition (result): 0.00/0.18 1 - x^0, rest remain the same}> 0.00/0.18 0.00/0.18 Calling reachability with... 0.00/0.18 Transition: 0.00/0.18 Conditions: x^0 <= 1, 0 <= x^0, 0.00/0.18 OPEN EXITS: 0.00/0.18 0.00/0.18 0.00/0.18 --- Reachability graph --- 0.00/0.18 > Graph without transitions. 0.00/0.18 0.00/0.18 Calling reachability with... 0.00/0.18 Transition: 0.00/0.18 Conditions: 0 <= x^0, x^0 <= 1, 0.00/0.18 OPEN EXITS: 0.00/0.18 0.00/0.18 0.00/0.18 > Conditions are reachable! 0.00/0.18 0.00/0.18 Program does NOT terminate 0.00/0.18 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.18 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.18 EOF