/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef5, oldX5^0 -> undef6, oldX6^0 -> undef7, oldX7^0 -> undef8, x0^0 -> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef17, oldX5^0 -> undef18, oldX6^0 -> undef19, oldX7^0 -> undef20, x0^0 -> (0 + undef17), x1^0 -> (0 + undef18), x2^0 -> (0 + undef19), x3^0 -> (0 + undef20)}> undef25, oldX1^0 -> undef26, oldX2^0 -> undef27, oldX3^0 -> undef28, x0^0 -> (~(1) + undef25), x1^0 -> (0 + undef28), x2^0 -> (0 + undef27), x3^0 -> (0 + undef26)}> undef37, oldX1^0 -> undef38, oldX2^0 -> undef39, oldX3^0 -> undef40, x0^0 -> (~(1) + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef40), x3^0 -> (0 + undef39)}> undef49, oldX1^0 -> undef50, oldX2^0 -> undef51, oldX3^0 -> undef52, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51), x3^0 -> (0 + undef52)}> undef61, oldX1^0 -> undef62, oldX2^0 -> undef63, oldX3^0 -> undef64, x0^0 -> (0 + undef61), x1^0 -> (0 + undef62), x2^0 -> (0 + undef63), x3^0 -> (0 + undef64)}> undef73, oldX1^0 -> undef74, oldX2^0 -> undef75, oldX3^0 -> undef76, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef75), x3^0 -> (0 + undef76)}> undef85, oldX1^0 -> undef86, oldX2^0 -> undef87, oldX3^0 -> undef88, x0^0 -> (0 + undef85), x1^0 -> (0 + undef86), x2^0 -> (0 + undef87), x3^0 -> (0 + undef88)}> undef97, oldX1^0 -> undef98, oldX2^0 -> undef99, oldX3^0 -> undef100, x0^0 -> (0 + undef97), x1^0 -> (0 + undef98), x2^0 -> (0 + undef99), x3^0 -> (0 + undef100)}> Fresh variables: undef5, undef6, undef7, undef8, undef17, undef18, undef19, undef20, undef25, undef26, undef27, undef28, undef37, undef38, undef39, undef40, undef49, undef50, undef51, undef52, undef61, undef62, undef63, undef64, undef73, undef74, undef75, undef76, undef85, undef86, undef87, undef88, undef97, undef98, undef99, undef100, Undef variables: undef5, undef6, undef7, undef8, undef17, undef18, undef19, undef20, undef25, undef26, undef27, undef28, undef37, undef38, undef39, undef40, undef49, undef50, undef51, undef52, undef61, undef62, undef63, undef64, undef73, undef74, undef75, undef76, undef85, undef86, undef87, undef88, undef97, undef98, undef99, undef100, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef75), x3^0 -> (0 + undef76)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef75), x3^0 -> (0 + undef76)}> (0 + undef17), x1^0 -> (0 + undef18), x2^0 -> (0 + undef19), x3^0 -> (0 + undef20)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef75), x3^0 -> (0 + undef76)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef5), x1^0 -> (0 + undef6), x2^0 -> (0 + undef7), x3^0 -> (0 + undef8)}> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef75), x3^0 -> (0 + undef76)}> Fresh variables: undef5, undef6, undef7, undef8, undef17, undef18, undef19, undef20, undef25, undef26, undef27, undef28, undef37, undef38, undef39, undef40, undef49, undef50, undef51, undef52, undef61, undef62, undef63, undef64, undef73, undef74, undef75, undef76, undef85, undef86, undef87, undef88, undef97, undef98, undef99, undef100, Undef variables: undef5, undef6, undef7, undef8, undef17, undef18, undef19, undef20, undef25, undef26, undef27, undef28, undef37, undef38, undef39, undef40, undef49, undef50, undef51, undef52, undef61, undef62, undef63, undef64, undef73, undef74, undef75, undef76, undef85, undef86, undef87, undef88, undef97, undef98, undef99, undef100, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef73, x1^0 -> undef74, x2^0 -> undef75, x3^0 -> undef76, rest remain the same}> undef73, x1^0 -> undef74, x2^0 -> undef75, x3^0 -> undef76, rest remain the same}> Variables: x0^0, x1^0, x2^0, x3^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef73, x1^0 -> undef74, x2^0 -> undef75, x3^0 -> undef76, rest remain the same}> undef73, x1^0 -> undef74, x2^0 -> undef75, x3^0 -> undef76, rest remain the same}> Graph 2 undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef17, x1^0 -> undef18, x2^0 -> undef19, x3^0 -> undef20, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> undef5, x1^0 -> undef6, x2^0 -> undef7, x3^0 -> undef8, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.009001 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004253s Ranking function: -3 + x0^0 New Graphs: Proving termination of subgraph 2 Analyzing SCC {l2}... No cycles found. Program Terminates