/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}> ~(5)}> 30)> 30))> 35}> (main_x - 1)}> 0}> 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}> ~(5)}> 30)> 30))> 35}> (main_x - 1)}> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 19, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [3 idents]: __VERIFIER_nondet_int | function | [integer, ()] | main | function | [integer, ()] | x | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: ~(5)}> 0}> 0) /\ (~(5) <= main_x) /\ (main_x <= 35) /\ not((main_x < 0)) /\ (main_x > 30), par{main_x -> 35}> 0) /\ (~(5) <= main_x) /\ (main_x <= 35) /\ not((main_x < 0)) /\ not((main_x > 30)), par{main_x -> (main_x - 1)}> 0) /\ (~(5) <= main_x) /\ not((main_x <= 35)), par{main_x -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 19, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -5, rest remain the same}> 0, rest remain the same}> 35, rest remain the same}> -1 + main_x, rest remain the same}> 0, rest remain the same}> Variables: main_x Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 19 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007009 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001724s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.065725s [13573 : 13574] [13573 : 13575] Successful child: 13574 [ 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: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> New Graphs: Transitions: 35, rest remain the same}> -1 + main_x, rest remain the same}> 0, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001057s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005788s Piecewise ranking function: min(-61 + 61*main_x,1829) New Graphs: Transitions: 35, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000485s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001575s [13573 : 13579] [13573 : 13580] Successful child: 13579 [ 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: 35, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + 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: 0, 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: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_x - Process 1 * Exit transition: * Postcondition : 0 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000393s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000458s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , LOG: CALL check - Post:main_x <= 8 - Process 2 * Exit transition: * Postcondition : main_x <= 8 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000377s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000431s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 8 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> invGraph after Narrowing: Transitions: -5, rest remain the same}> 35, rest remain the same}> -1 + main_x, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001168s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015377s Piecewise ranking function: min(36,5 + main_x) New Graphs: Transitions: -5, rest remain the same}> 35, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000860s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003442s [13573 : 13584] [13573 : 13585] Successful child: 13584 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, 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): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Transitions: -5, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000509s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001639s [13573 : 13589] [13573 : 13590] Successful child: 13589 [ 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: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -5, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 30 - Process 3 * Exit transition: * Postcondition : main_x <= 30 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000453s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000522s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 30 , LOG: CALL check - Post:1 <= main_x - Process 4 * Exit transition: * Postcondition : 1 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000470s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000534s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_x , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: -1 + main_x, rest remain the same}> invGraph after Narrowing: Transitions: -5, rest remain the same}> 35, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000895s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003614s [13573 : 13594] [13573 : 13595] Successful child: 13594 [ 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: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 35, rest remain the same}> New Graphs: Transitions: 35, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000529s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001698s [13573 : 13599] [13573 : 13600] Successful child: 13599 [ 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: 35, 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: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_x - Process 5 * Exit transition: * Postcondition : 0 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000512s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000582s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , LOG: CALL check - Post:36 <= main_x - Process 6 * Exit transition: * Postcondition : 36 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000473s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000538s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 36 <= main_x , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -5, rest remain the same}> 35, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000922s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003652s [13573 : 13604] [13573 : 13605] Successful child: 13604 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Transitions: -5, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000519s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001665s [13573 : 13609] [13573 : 13610] Successful child: 13609 [ 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: -5, 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: -5, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 2 - Process 7 * Exit transition: * Postcondition : main_x <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000600s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000680s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 2 , LOG: CALL check - Post:6 + main_x <= 0 - Process 8 * Exit transition: * Postcondition : 6 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000473s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000535s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 6 + main_x <= 0 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -5, rest remain the same}> 35, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000905s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003632s [13573 : 13614] [13573 : 13615] Successful child: 13614 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: Transitions: -5, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000510s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001648s [13573 : 13619] [13573 : 13620] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087575s Time used: 0.087164 [13573 : 13624] [13573 : 13628] Successful child: 13624 Program does NOT terminate