/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef2}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef2}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^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.001815 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000569s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002067s [38499 : 38500] [38499 : 38501] Successful child: 38500 [ 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: undef2, 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: undef2, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + x^0 <= __const_200^0 - Process 1 * Exit transition: * Postcondition : 1 + x^0 <= __const_200^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000293s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000361s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + x^0 <= __const_200^0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000641s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002419s [38499 : 38505] [38499 : 38506] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006694s Time used: 0.0063 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012116s Time used: 0.012113 LOG: SAT solveNonLinear - Elapsed time: 0.018810s Cost: 1; Total time: 0.018413 Quasi-ranking function: 50000 + __const_200^0 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000632s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002672s [38499 : 38582] [38499 : 38583] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006810s Time used: 0.006345 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015556s Time used: 0.015553 LOG: SAT solveNonLinear - Elapsed time: 0.022366s Cost: 1; Total time: 0.021898 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000696s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002811s [38499 : 38857] [38499 : 38858] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007925s Time used: 0.007424 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014428s Time used: 0.014425 LOG: SAT solveNonLinear - Elapsed time: 0.022354s Cost: 1; Total time: 0.021849 Quasi-ranking function: 50000 - __const_200^0 - x^0 New Graphs: Transitions: undef2, rest remain the same}> Variables: __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000782s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003120s [38499 : 38889] [38499 : 38890] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007610s Time used: 0.007178 [38499 : 39146] [38499 : 39150] Successful child: 39146 Program does NOT terminate