/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: ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> (arg2 - 1), arg4 -> 0, arg5 -> arg2}> ~(1)) /\ (arg3 > arg2) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg3 -> (arg5 - 1), arg4 -> undef9}> 0) /\ (undef12 > arg4) /\ (arg1 > 0), par{arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> 0) /\ (arg3 <= arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (undef26 < undef22) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25}> ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31}> ~(1)) /\ (undef38 > 0) /\ (undef38 < arg2) /\ (undef39 > undef38) /\ (undef40 > undef38) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> ~(1)) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45}> undef47, arg2 -> undef48, arg3 -> undef49, arg4 -> undef50, arg5 -> undef51}> Fresh variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Undef variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef47 > 0) /\ (undef1 > 0)> ~(1)) /\ (arg3 > arg2) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg3 -> (arg5 - 1), arg4 -> undef9}> 0) /\ (undef12 > arg4) /\ (arg1 > 0), par{arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> 0) /\ (arg3 <= arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (undef26 < undef22) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25}> ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31}> ~(1)) /\ (undef38 > 0) /\ (undef38 < arg2) /\ (undef39 > undef38) /\ (undef40 > undef38) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> ~(1)) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45}> Fresh variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Undef variables: undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 2: Transitions: 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25, rest remain the same}> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31, rest remain the same}> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, rest remain the same}> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 Graph 2 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004647 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001013s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004022s [47922 : 47923] [47922 : 47924] Successful child: 47923 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, 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): undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> Ranking function: -arg2 + arg5 New Graphs: INVARIANTS: 2: 1 + arg3 <= arg5 , Quasi-INVARIANTS to narrow Graph: 2: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.074501 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004112s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.067007s [47922 : 47928] [47922 : 47929] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.449818s Time used: 0.447924 Termination failed. Trying to show unreachability... Proving unreachability of entry: 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001383s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001527s LOG: NarrowEntry size 1 Narrowing transition: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> END GRAPH: EXIT: 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47922 : 47969] [47922 : 47970] [47922 : 47971] Successful child: 47970 LOG: CALL check - Post:arg1 + arg3 <= arg2 - Process 3 * Exit transition: * Postcondition : arg1 + arg3 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002342s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002518s LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg3 <= arg2 , arg2 + arg4 <= arg1 + arg3 , Narrowing transition: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> LOG: Narrow transition size 2 ENTRIES: END ENTRIES: GRAPH: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> END GRAPH: EXIT: 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47922 : 48051] [47922 : 48052] [47922 : 48053] Successful child: 48052 LOG: CALL check - Post:arg3 <= arg2 - Process 4 * Exit transition: * Postcondition : arg3 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001659s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001862s LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg3 <= arg2 , arg4 <= 0 , Narrowing transition: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> LOG: Narrow transition size 2 ENTRIES: END ENTRIES: GRAPH: undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}> END GRAPH: EXIT: 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47922 : 48054] [47922 : 48055] [47922 : 48056] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.635720s Cannot prove unreachability [47922 : 48059] [47922 : 48060] Successful child: 48059 Program does NOT terminate