/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_w -> 5}> (main_i - 1), main_i -> (main_i * ~(1))}> main_w)> main_w))> (main_i + 1), main_i -> (main_i * ~(1))}> 0}> (main_w + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1, main_w -> 5}> (main_i - 1), main_i -> (main_i * ~(1))}> main_w)> main_w))> (main_i + 1), main_i -> (main_i * ~(1))}> 0}> (main_w + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | w | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: ((main_i - 1) * ~(1)), main_w -> (main_w + 1)}> main_w)), par{main_i -> 0, main_w -> (main_w + 1)}> 0) /\ (main_i < ~(main_w)), par{main_i -> ((main_i - 1) * ~(1)), main_w -> (main_w + 1)}> 0) /\ not((main_i < ~(main_w))) /\ (main_i > main_w), par{main_i -> ((main_i + 1) * ~(1)), main_w -> (main_w + 1)}> 0) /\ not((main_i < ~(main_w))) /\ not((main_i > main_w)), par{main_i -> 0, main_w -> (main_w + 1)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 - main_i, main_w -> 1 + main_w, rest remain the same}> 0, main_w -> 1 + main_w, rest remain the same}> 1 - main_i, main_w -> 1 + main_w, rest remain the same}> -1 - main_i, main_w -> 1 + main_w, rest remain the same}> 0, main_w -> 1 + main_w, rest remain the same}> Variables: main_i, main_w Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 15 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.01178 Some transition disabled by a set of invariant(s): Invariant at l2: 1 <= main_w Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, main_w -> 1 + main_w, rest remain the same}> Checking unfeasibility... Time used: 0.008323 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002473s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.298553s [1390 : 1391] [1390 : 1392] Successful child: 1391 [ 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 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, main_w -> 1 + main_w, 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 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, main_w -> 1 + main_w, rest remain the same}> New Graphs: Transitions: 0, main_w -> 1 + main_w, rest remain the same}> 0, main_w -> 1 + main_w, rest remain the same}> Variables: main_i, main_w Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001177s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016983s [1390 : 1396] [1390 : 1397] Successful child: 1397 Ranking function: main_i Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 0, main_w -> 1 + main_w, rest remain the same}> Variables: main_i, main_w Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001186s Ranking function: -1 - main_i New Graphs: [1390 : 1401] [1390 : 1402] INVARIANTS: 2: 0 <= 7 + main_w , Quasi-INVARIANTS to narrow Graph: 2: main_i <= main_w , 0 <= main_i + main_w , Narrowing transition: 1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, main_w -> 1 + main_w, rest remain the same}> Narrowing transition: -1 - main_i, main_w -> 1 + main_w, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, main_w -> 1 + main_w, rest remain the same}> invGraph after Narrowing: Transitions: 1 - main_i, main_w -> 1 + main_w, rest remain the same}> -1 - main_i, main_w -> 1 + main_w, rest remain the same}> Variables: main_i, main_w Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001320s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.050391s [1390 : 1403] [1390 : 1404] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018496s Time used: 0.017737 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000525s Time used: 1.00055 LOG: SAT solveNonLinear - Elapsed time: 1.019021s Cost: 1; Total time: 1.01829 Quasi-ranking function: 50000 - main_w New Graphs: Transitions: 1 - main_i, main_w -> 1 + main_w, rest remain the same}> -1 - main_i, main_w -> 1 + main_w, rest remain the same}> Variables: main_i, main_w Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001399s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.116351s [1390 : 1408] [1390 : 1409] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101663s Time used: 4.10101 [1390 : 1413] [1390 : 1417] Successful child: 1413 Program does NOT terminate