/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: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> ~(1)) /\ (arg1 < 10) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef4}> undef6}> 5) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > ~(1))> ~(1)) /\ (arg1 < 10) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}> 5) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Graph 2: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Graph 2 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.001624 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000585s Ranking function: 9 - arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003137 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.001123s [58480 : 58488] [58480 : 58489] Successful child: 58488 [ 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: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 FIXED: Entro call FIXED (try DiffLogic): 0 LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003633s Time used: 0.003533 FIXED (FARKAS): fail FIXED (FARKAS): 0.003951 FIXED: Entro call FIXED (try DiffLogic): 0 LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007024s Time used: 0.006827 FIXED (FARKAS): fail FIXED (FARKAS): 0.007406 LOG: Try proving POST [58480 : 58820] [58480 : 58821] [58480 : 58822] Successful child: 58820 LOG: CALL check - Post:10 <= arg1 - Process 2 * Exit transition: * Postcondition : 10 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001224s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001340s LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 10 <= arg1 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + arg1, rest remain the same}> END GRAPH: EXIT: POST: arg1 <= 0 LOG: Try proving POST [58480 : 58844] [58480 : 58845] [58480 : 58846] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.085371s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 <= 0 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000443s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001254s [58480 : 58891] [58480 : 58892] Successful child: 58891 [ 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: 1 + arg1, 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: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 5 - Process 3 * Exit transition: * Postcondition : arg1 <= 5 FIXED: Entro call FIXED (try DiffLogic): 0 LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010669s Time used: 0.010571 FIXED (FARKAS): fail FIXED (FARKAS): 0.01102 FIXED: Entro call FIXED (try DiffLogic): 0 LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010187s Time used: 0.009896 FIXED (FARKAS): fail FIXED (FARKAS): 0.010479 LOG: Try proving POST [58480 : 58896] [58480 : 58897] [58480 : 58898] Successful child: 58896 LOG: Postcondition is not implied - Post: 10 <= arg1 - Already checked Already checked with failure LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 10 <= arg1 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + arg1, rest remain the same}> END GRAPH: EXIT: POST: arg1 <= 5 LOG: Try proving POST [58480 : 58899] [58480 : 58900] [58480 : 58901] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 2.269413s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 <= 5 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000447s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001286s [58480 : 59049] [58480 : 59050] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005456s Time used: 0.00512 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000285s Time used: 1.0003 LOG: SAT solveNonLinear - Elapsed time: 1.005741s Cost: 1; Total time: 1.00542 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, 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): 1 + arg1, rest remain the same}> Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000419s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001243s [58480 : 59054] [58480 : 59055] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104301s Time used: 4.10149 [58480 : 59440] [58480 : 59443] Successful child: 59440 Program does NOT terminate