NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (0 + temp0_14^0)}> undef19, nondet_12^0 -> undef21, x_15^0 -> undef24}> undef37, nondet_12^0 -> undef38, x_15^0 -> (0 + undef42)}> undef43}> undef53}> undef60}> Fresh variables: undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, Undef variables: undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef19}> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53}> Fresh variables: undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, Undef variables: undef19, undef21, undef24, undef25, undef37, undef38, undef42, undef43, undef53, undef60, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef19, rest remain the same}> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Variables: a_13^0, __disjvr_0^0, __disjvr_1^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004559 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001630s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010573s Trying to remove transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012112s Time used: 0.011582 Trying to remove transition: undef19, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008390s Time used: 0.007589 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019938s Time used: 0.019363 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044435s Time used: 0.04443 LOG: SAT solveNonLinear - Elapsed time: 0.064373s Cost: 1; Total time: 0.063793 Failed at location 2: 1 + a_13^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + a_13^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007417s Remaining time after improvement: 0.997082 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + a_13^0 <= 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: undef19, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef19, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> New Graphs: Calling Safety with literal 1 + a_13^0 <= 0 and entry LOG: CALL check - Post:1 + a_13^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + a_13^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000585s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000648s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + a_13^0 <= 0 , Narrowing transition: undef19, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef19, rest remain the same}> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Variables: a_13^0, __disjvr_0^0, __disjvr_1^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001522s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009695s Trying to remove transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010950s Time used: 0.010333 Trying to remove transition: undef19, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008385s Time used: 0.007554 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026849s Time used: 0.026124 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029472s Time used: 0.029467 LOG: SAT solveNonLinear - Elapsed time: 0.056321s Cost: 1; Total time: 0.055591 Failed at location 2: a_13^0 <= 0 Before Improving: Quasi-invariant at l2: a_13^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007477s Remaining time after improvement: 0.997034 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: a_13^0 <= 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: undef19, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, 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: undef19, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> New Graphs: Calling Safety with literal a_13^0 <= 0 and entry LOG: CALL check - Post:a_13^0 <= 0 - Process 2 * Exit transition: * Postcondition : a_13^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000635s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000703s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: a_13^0 <= 0 , Narrowing transition: undef19, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef19, rest remain the same}> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Variables: a_13^0, __disjvr_0^0, __disjvr_1^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001560s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009667s Trying to remove transition: undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011076s Time used: 0.010418 Trying to remove transition: undef19, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008443s Time used: 0.007564 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031876s Time used: 0.031364 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002089s Time used: 4.00069 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006674s Time used: 1.00002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038962s Time used: 0.016596 Proving non-termination of subgraph 1 Transitions: undef19, rest remain the same}> undef43, __disjvr_1^0 -> undef60, a_13^0 -> undef53, rest remain the same}> Variables: a_13^0, __disjvr_0^0, __disjvr_1^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002471s Checking conditional non-termination of SCC {l2}... > No assignment for some undef value. > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 1 <= a_13^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= a_13^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate