/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: ~(1)) /\ ((undef2 - 1) <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 1), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 1, arg4 -> arg2}> 0) /\ (arg4 <= arg3) /\ (arg2 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}> ~(1)) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> 0) /\ (undef17 > ~(1)), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> (arg3 + 2)) /\ (arg4 > (arg3 + 1)) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (undef21 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > 6), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 + 4)}> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}> Fresh variables: undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, Undef variables: undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ ((undef2 - 1) <= undef25) /\ (undef25 > 0) /\ (undef1 > 0) /\ (undef2 > 1)> 0) /\ (arg4 <= arg3) /\ (arg2 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}> (arg3 + 2)) /\ (arg4 > (arg3 + 1)) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (undef21 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > 6), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 + 4)}> ~(1)) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> 0) /\ (undef17 > ~(1)), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> Fresh variables: undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, Undef variables: undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 3: Transitions: undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 Graph 2 undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> Graph 3 undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ( 4 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005667 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001486s Ranking function: (~(3) / 4) + (~(1) / 4)*arg3 + (1 / 4)*arg4 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002595 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000865s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002327s [39714 : 39715] [39714 : 39716] Successful child: 39715 [ 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: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> * Postcondition : arg1 <= 0 Postcodition moved up: undef5 <= 0 LOG: Try proving POST LOG: CALL check - Post:undef5 <= 0 - Process 2 * Exit transition: * Postcondition : undef5 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000966s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001135s LOG: NarrowEntry size 1 Narrowing transition: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> END GRAPH: EXIT: undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> POST: arg1 <= 0 LOG: Try proving POST [39714 : 39720] [39714 : 39721] [39714 : 39722] Successful child: 39722 [39714 : 39723] [39714 : 39724] LOG: NarrowEntry size 2 INVARIANTS: 2: 1 <= arg1 , Quasi-INVARIANTS to narrow Graph: 2: arg4 <= 1 + arg3 , arg1 + arg3 <= arg4 , Narrowing transition: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> LOG: Narrow transition size 2 ENTRIES: END ENTRIES: GRAPH: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> END GRAPH: EXIT: undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> POST: arg1 <= 0 LOG: Try proving POST [39714 : 39725] [39714 : 39726] [39714 : 39727] Successful child: 39727 [39714 : 39728] [39714 : 39729] LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg3 <= arg4 , 1 <= arg3 , arg4 <= 1 + arg3 , Narrowing transition: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> LOG: Narrow transition size 3 ENTRIES: END ENTRIES: GRAPH: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> END GRAPH: EXIT: undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> POST: arg1 <= 0 LOG: Try proving POST [39714 : 39730] [39714 : 39731] [39714 : 39732] Successful child: 39730 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}> [39714 : 39733] [39714 : 39734] [39714 : 39735] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 7.351754s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 <= 0 , Narrowing transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000866s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002590s [39714 : 39736] [39714 : 39737] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009120s Time used: 0.008782 [39714 : 39741] [39714 : 39745] Successful child: 39745 Program does NOT terminate