/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef7}> ((0 + x^0) + y^0)}> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef7, x^0 -> ((0 + x^0) + y^0)}> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 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.00219 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000598s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001957s [41609 : 41611] [41609 : 41612] Successful child: 41611 [ 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: undef7, x^0 -> x^0 + y^0, 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: undef7, x^0 -> x^0 + y^0, rest remain the same}> New Graphs: LOG: CALL check - Post:x^0 <= 0 - Process 1 * Exit transition: * Postcondition : x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000266s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000327s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x^0 <= 0 , Narrowing transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000594s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002035s [41609 : 41620] [41609 : 41621] Successful child: 41620 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, x^0 -> x^0 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, x^0 -> x^0 + y^0, rest remain the same}> Ranking function: x^0 New Graphs: LOG: CALL check - Post:x^0 + y^0 <= 0 - Process 2 * Exit transition: * Postcondition : x^0 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000300s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000373s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x^0 + y^0 <= 0 , Narrowing transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000663s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002504s [41609 : 41628] [41609 : 41629] Successful child: 41628 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, x^0 -> x^0 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, x^0 -> x^0 + y^0, rest remain the same}> Ranking function: x^0 New Graphs: LOG: CALL check - Post:1 + y^0 <= 0 - Process 3 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000340s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000417s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + y^0 <= 0 , Narrowing transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000714s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002721s [41609 : 41637] [41609 : 41638] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007689s Time used: 0.007273 [41609 : 41967] [41609 : 41971] Successful child: 41967 Program does NOT terminate