NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 5), par{arg1 -> (arg1 + 1), arg2 -> undef4}> 0) /\ (arg1 < 6), par{arg1 -> 0, arg2 -> undef6}> undef7, arg2 -> undef8}> Fresh variables: undef2, undef4, undef6, undef7, undef8, Undef variables: undef2, undef4, undef6, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef8 > ~(1))> 5), par{arg1 -> (arg1 + 1)}> 0) /\ (arg1 < 6), par{arg1 -> 0}> Fresh variables: undef2, undef4, undef6, undef7, undef8, Undef variables: undef2, undef4, undef6, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, rest remain the same}> 0, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002881 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000740s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003398s Piecewise ranking function: min(-7 + 7*arg1,71 - 6*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000399s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001146s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003483s Time used: 0.003361 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006453s Time used: 0.006175 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019311s Time used: 0.019305 LOG: SAT solveNonLinear - Elapsed time: 0.025764s Cost: 1; Total time: 0.02548 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002110s Remaining time after improvement: 0.999137 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000495s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000586s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 0, rest remain the same}> invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000391s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001174s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003359s Time used: 0.003229 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004548s Time used: 0.004261 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010986s Time used: 0.010981 LOG: SAT solveNonLinear - Elapsed time: 0.015534s Cost: 1; Total time: 0.015242 Failed at location 2: arg1 <= 1 Before Improving: Quasi-invariant at l2: arg1 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001408s Remaining time after improvement: 0.999293 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 1 and entry LOG: CALL check - Post:arg1 <= 1 - Process 2 * Exit transition: * Postcondition : arg1 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000514s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000610s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 1 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000392s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001173s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003334s Time used: 0.003213 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010403s Time used: 0.010158 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012901s Time used: 0.012897 LOG: SAT solveNonLinear - Elapsed time: 0.023304s Cost: 1; Total time: 0.023055 Failed at location 2: arg1 <= 2 Before Improving: Quasi-invariant at l2: arg1 <= 2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001887s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001179s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001174s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000860s Remaining time after improvement: 0.996148 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 5 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 5 and entry LOG: CALL check - Post:arg1 <= 5 - Process 3 * Exit transition: * Postcondition : arg1 <= 5 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000504s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000599s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 5 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000386s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001205s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003342s Time used: 0.00322 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001357s Time used: 4.00097 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006268s Time used: 4.00085 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006874s Time used: 1.00076 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009523s Time used: 0.005646 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012963s Time used: 0.012957 LOG: SAT solveNonLinear - Elapsed time: 0.022486s Cost: 1; Total time: 0.018603 Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000417s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001273s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003655s Time used: 0.003529 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003738s Time used: 4.00319 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006912s Time used: 4.00082 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007318s Time used: 1.00113 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008591s Time used: 0.00494 Proving non-termination of subgraph 1 Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020656s Time used: 0.020496 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004561s Time used: 0.004556 LOG: SAT solveNonLinear - Elapsed time: 0.025216s Cost: 1; Total time: 0.025052 Failed at location 2: 6 <= arg1 Before Improving: Quasi-invariant at l2: 6 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001617s Remaining time after improvement: 0.999026 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 6 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 6 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 6 <= arg1, OPEN EXITS: > Conditions are reachable! Program does NOT terminate