NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 1}> undef3}> 0}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef3, b^0 -> 0}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef3, b^0 -> 0, rest remain the same}> Variables: __disjvr_0^0, b^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001677 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000535s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001549s Trying to remove transition: undef3, b^0 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003813s Time used: 0.003647 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003965s Time used: 0.003728 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006476s Time used: 0.006474 LOG: SAT solveNonLinear - Elapsed time: 0.010441s Cost: 1; Total time: 0.010202 Failed at location 1: 1 + b^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + b^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001106s Remaining time after improvement: 0.999403 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + b^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: undef3, b^0 -> 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef3, b^0 -> 0, rest remain the same}> New Graphs: Calling Safety with literal 1 + b^0 <= 0 and entry LOG: CALL check - Post:1 + b^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + b^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000153s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000176s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + b^0 <= 0 , Narrowing transition: undef3, b^0 -> 0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef3, b^0 -> 0, rest remain the same}> Variables: __disjvr_0^0, b^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000237s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000731s Trying to remove transition: undef3, b^0 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001740s Time used: 0.001669 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003413s Time used: 0.003273 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000418s Time used: 4.00017 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002914s Time used: 1.0002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003844s Time used: 0.002189 Proving non-termination of subgraph 1 Transitions: undef3, b^0 -> 0, rest remain the same}> Variables: __disjvr_0^0, b^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000505s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008176s Time used: 0.008055 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010829s Time used: 0.010828 LOG: SAT solveNonLinear - Elapsed time: 0.019005s Cost: 1; Total time: 0.018883 Failed at location 1: 0 <= b^0 Before Improving: Quasi-invariant at l1: 0 <= b^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003401s Remaining time after improvement: 0.999122 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001146s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= b^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef3, b^0 -> 0, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= b^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= b^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate