/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: 0, arg2 -> undef2}> 9) /\ (arg1 < 100), par{arg1 -> (arg1 + 1), arg2 -> undef4}> undef6}> 49), par{arg2 -> undef8}> 0}> (arg2 + 1)}> 14), par{arg1 -> (arg1 + 1), arg2 -> undef14}> undef15, arg2 -> undef16}> Fresh variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Undef variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 9) /\ (arg1 < 100), par{arg1 -> (arg1 + 1), arg2 -> undef4}> 49), par{arg2 -> undef8}> 0}> undef6}> (arg2 + 1)}> 14), par{arg1 -> (arg1 + 1), arg2 -> undef14}> Fresh variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Undef variables: undef2, undef4, undef6, undef8, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> undef4, rest remain the same}> 0, rest remain the same}> 1 + arg2, rest remain the same}> 1 + arg1, arg2 -> undef14, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: undef6, rest remain the same}> Variables: arg2 Precedence: Graph 0 Graph 1 Graph 2 undef8, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.313694 Checking conditional termination of SCC {l2, l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004015s Ranking function: 49 - arg1 New Graphs: Transitions: 0, rest remain the same}> 1 + arg2, rest remain the same}> 1 + arg1, arg2 -> undef14, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2, l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000999s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004418s [26355 : 26356] [26355 : 26357] Successful child: 26356 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> undef14, rest remain the same}> Ranking function: 9 - arg1 New Graphs: Transitions: 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000842s Ranking function: 14 - arg2 New Graphs: INVARIANTS: 4: arg1 <= 9 , Quasi-INVARIANTS to narrow Graph: 4: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001277 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000468s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001166s [26355 : 26361] [26355 : 26362] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003623s Time used: 0.003419 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef8, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef8, 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.000579s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000657s LOG: NarrowEntry size 1 Narrowing transition: 1 + arg1, arg2 -> undef4, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, arg2 -> undef14, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + arg1, arg2 -> undef4, rest remain the same}> 0, rest remain the same}> 1 + arg2, rest remain the same}> 1 + arg1, arg2 -> undef14, rest remain the same}> END GRAPH: EXIT: undef8, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [26355 : 26366] [26355 : 26367] [26355 : 26368] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.159219s Cannot prove unreachability [26355 : 26369] [26355 : 26370] Successful child: 26369 Program does NOT terminate