/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (~(1) + deltaext^0)}> (1 + deltaext^0)}> 2}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + deltaext^0)}> (1 + deltaext^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003663 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000817s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008793s [37162 : 37163] [37162 : 37164] Successful child: 37163 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> Ranking function: 4 + deltaext^0 + wnt^0 New Graphs: [37162 : 37168] [37162 : 37169] INVARIANTS: 1: 0 <= wnt^0 , Quasi-INVARIANTS to narrow Graph: 1: 1 <= deltaext^0 , wnt^0 <= 0 , Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001400s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024658s [37162 : 37170] [37162 : 37171] Successful child: 37170 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^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 Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001111s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013070s [37162 : 37175] [37162 : 37176] Successful child: 37175 [ 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 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^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: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> Ranking function: -deltaext^0 + 2*wnt^0 New Graphs: LOG: CALL check - Post:1 <= deltaext^0 - Process 1 * Exit transition: * Postcondition : 1 <= deltaext^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000623s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000724s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= deltaext^0 , [37162 : 37180] [37162 : 37181] [37162 : 37182] INVARIANTS: 1: 0 <= deltaext^0 , Quasi-INVARIANTS to narrow Graph: 1: deltaext^0 <= 1 + wnt^0 , wnt^0 <= 1 , Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001998s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.050222s [37162 : 37183] [37162 : 37184] Successful child: 37183 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^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 Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001685s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029894s [37162 : 37188] [37162 : 37189] Successful child: 37188 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001305s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015127s [37162 : 37193] [37162 : 37194] Successful child: 37193 [ 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 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001431s Ranking function: (1 / 2) - deltaext^0 + (1 / 2)*wnt^0 New Graphs: LOG: CALL check - Post:deltaext^0 <= 1 + wnt^0 - Process 2 * Exit transition: * Postcondition : deltaext^0 <= 1 + wnt^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000668s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000778s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: deltaext^0 <= 1 + wnt^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= deltaext^0 , LOG: CALL check - Post:deltaext^0 <= wnt^0 - Process 3 * Exit transition: * Postcondition : deltaext^0 <= wnt^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000699s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000816s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: deltaext^0 <= wnt^0 , wnt^0 <= 3 , Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002452s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.090368s [37162 : 37198] [37162 : 37199] Successful child: 37198 [ 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 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> > It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001824s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043027s [37162 : 37203] [37162 : 37204] Successful child: 37204 Ranking function: -deltaext^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002502s Ranking function: -26 + 13*deltaext^0 - 13*wnt^0 New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001314s Ranking function: -1 + deltaext^0 - wnt^0 New Graphs: INVARIANTS: 1: wnt^0 <= 3 , Quasi-INVARIANTS to narrow Graph: 1: Program Terminates