/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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_x -> ¿functionCall(__VERIFIER_nondet_int)}> 1))> 1)> = (2 * main_oldx)))> = (2 * main_oldx))> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 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}> 1)> 1))> = (2 * main_oldx))> = (2 * main_oldx)))> main_x}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 7, 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, ()] | x | local variable | integer | | oldx | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 1) /\ (main_x >= (2 * main_oldx)), par{main_x -> undef4, main_oldx -> main_x}> 1) /\ not((main_x >= (2 * main_oldx)))> 1))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 7 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001803 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000663s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002046s [44032 : 44033] [44032 : 44034] Successful child: 44033 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000365s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000434s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000645s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002178s [44032 : 44038] [44032 : 44039] Successful child: 44038 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= main_oldx - Process 2 * Exit transition: * Postcondition : main_x <= main_oldx LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000480s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000566s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000675s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002473s [44032 : 44043] [44032 : 44044] Successful child: 44043 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 3 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000536s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000622s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000663s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002488s [44032 : 44048] [44032 : 44049] Successful child: 44048 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 1 - Process 4 * Exit transition: * Postcondition : main_x <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000568s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000658s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000675s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002493s [44032 : 44053] [44032 : 44054] Successful child: 44053 [ 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: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [44032 : 44058] [44032 : 44059] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2 <= main_oldx , main_x <= 1 + main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001636s Ranking function: 2 - 2*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000725s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002976s [44032 : 44060] [44032 : 44061] Successful child: 44060 [ 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: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [44032 : 44065] [44032 : 44066] [44032 : 44067] [44032 : 44068] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 2 + main_oldx , 3 <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002908s Ranking function: 1 + (~(1) / 2)*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000719s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002828s [44032 : 44069] [44032 : 44070] Successful child: 44069 [ 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: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [44032 : 44074] [44032 : 44075] [44032 : 44076] [44032 : 44077] [44032 : 44078] [44032 : 44079] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 3 + main_oldx , 4 <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004060s Ranking function: 30 - 15*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001747s Ranking function: 63 - 21*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000727s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002869s [44032 : 44080] [44032 : 44081] Successful child: 44080 [ 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: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, main_oldx -> main_x, rest remain the same}> New Graphs: [44032 : 44085] [44032 : 44086] [44032 : 44087] [44032 : 44088] [44032 : 44089] [44032 : 44090] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 4 + main_oldx , 5 <= main_oldx , Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: undef4, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005580s Ranking function: 30 - 15*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002433s Ranking function: 63 - 21*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001827s Ranking function: 108 - 27*main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000733s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003032s [44032 : 44091] [44032 : 44092] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030515s Time used: 0.029815 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.075493s Time used: 0.075492 LOG: SAT solveNonLinear - Elapsed time: 0.106008s Cost: 1; Total time: 0.105307 Quasi-ranking function: 50000 - main_oldx New Graphs: Transitions: undef4, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000825s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003503s [44032 : 44096] [44032 : 44097] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021742s Time used: 0.02132 [44032 : 44101] [44032 : 44105] Successful child: 44101 Program does NOT terminate