/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: (0 + y^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^0)}> (0 + y^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: y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> Variables: x^0, y^0, z0^0, z1^0, z2^0, z3^0, z4^0, z5^0, z6^0, z7^0, z8^0, z10^0, z11^0, z12^0, z13^0, z9^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 8 , 1 ) ( 13 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 4.10012 Checking conditional termination of SCC {l2, l8, l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.087455s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.015820s [36624 : 36777] [36624 : 36778] Successful child: 36778 Ranking function: -x^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> y^0, rest remain the same}> Variables: x^0, y^0, z0^0, z10^0, z11^0, z12^0, z13^0, z1^0, z2^0, z3^0, z4^0, z5^0, z6^0, z7^0, z8^0, z9^0 Checking conditional termination of SCC {l2, l8, l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029130s Ranking function: 4 + x^0 - 4*y^0 New Graphs: Program Terminates