/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0) /\ (undef4 > ~(1)) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> 0, arg3 -> undef4}> ~(1)) /\ (arg2 > 1) /\ (undef7 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef7}> 0) /\ ((arg2 - 1) < arg2) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 - 1), arg3 -> (arg1 + arg2)}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef4, undef7, undef8, undef13, undef14, undef15, Undef variables: undef4, undef7, undef8, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (0 = undef14), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0) /\ (undef4 > ~(1)) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> 0, arg3 -> undef4}> ~(1)) /\ (undef14 > 1) /\ (undef7 > ~(1)) /\ (undef13 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef7}> 0) /\ ((arg2 - 1) < arg2) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 - 1), arg3 -> (arg1 + arg2)}> Fresh variables: undef4, undef7, undef8, undef13, undef14, undef15, Undef variables: undef4, undef7, undef8, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 0, arg2 -> 0, arg3 -> 0, rest remain the same}> undef4, arg2 -> 0, arg3 -> undef4, rest remain the same}> undef7, arg2 -> undef8, arg3 -> undef7, rest remain the same}> 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.003194 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000626s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001961s [6167 : 6175] [6167 : 6176] Successful child: 6175 [ 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: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> New Graphs: [6167 : 6518] [6167 : 6519] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg3 <= 0 , Narrowing transition: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000668s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002378s [6167 : 6525] [6167 : 6526] Successful child: 6525 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, 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): arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Ranking function: 482 + arg2 New Graphs: [6167 : 7329] [6167 : 7330] [6167 : 7331] [6167 : 7333] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg3 <= 2 , arg1 <= 483 + arg2 , Narrowing transition: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001534s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.025602s [6167 : 7346] [6167 : 7347] Successful child: 7346 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, 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): arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Ranking function: arg1 + arg2 New Graphs: Transitions: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001340s Ranking function: (~(1) / 241) + (3 / 482)*arg1 + (~(1) / 482)*arg3 New Graphs: LOG: CALL check - Post:arg2 <= 0 - Process 1 * Exit transition: undef7, arg2 -> undef8, arg3 -> undef7, rest remain the same}> * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000553s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000673s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , It's unfeasible. Removing transition: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Narrowing transition: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: arg1 + arg2, arg2 -> -1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001220s Ranking function: -1 + arg2 New Graphs: Program Terminates