NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 1}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, rest remain the same}> Variables: 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.001741 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000638s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001189s Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003178s Time used: 0.00306 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004194s Time used: 0.003962 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009729s Time used: 0.009724 LOG: SAT solveNonLinear - Elapsed time: 0.013923s Cost: 1; Total time: 0.013686 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.001626s Remaining time after improvement: 0.999082 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: 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 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.000266s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000329s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + b^0 <= 0 , Narrowing transition: 0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 0, rest remain the same}> Variables: b^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000591s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001169s Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002843s Time used: 0.002725 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003735s Time used: 0.003514 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001392s Time used: 4.00092 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038482s Time used: 1.00043 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006067s Time used: 0.003025 Proving non-termination of subgraph 1 Transitions: 0, rest remain the same}> Variables: b^0 Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003172s Time used: 0.003027 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003943s Time used: 0.003939 LOG: SAT solveNonLinear - Elapsed time: 0.007115s Cost: 1; Total time: 0.006966 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.001292s Remaining time after improvement: 0.999255 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): 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