0.00/0.12 YES 0.00/0.12 0.00/0.12 Solver Timeout: 4 0.00/0.12 Global Timeout: 300 0.00/0.12 No parsing errors! 0.00/0.12 Init Location: 0 0.00/0.12 Transitions: 0.00/0.12 0.00/0.12 0.00/0.12 0.00/0.12 (1 + walker^0)}> 0.00/0.12 (~(1) + walker^0)}> 0.00/0.12 undef29, i^0 -> (0 + undef33), pos^0 -> 0, seq^0 -> undef33, walker^0 -> 1, z^0 -> undef35}> 0.00/0.12 (0 + undef40), seq^0 -> undef40, z^0 -> undef42}> 0.00/0.12 (~(1) + i^0)}> 0.00/0.12 (~(1) + z^0)}> 0.00/0.12 0.00/0.12 0.00/0.12 undef72}> 0.00/0.12 0.00/0.12 0.00/0.12 0.00/0.12 0.00/0.12 0.00/0.12 Fresh variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Undef variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Abstraction variables: 0.00/0.12 0.00/0.12 Exit nodes: 0.00/0.12 0.00/0.12 Accepting locations: 0.00/0.12 0.00/0.12 Asserts: 0.00/0.12 0.00/0.12 Preprocessed LLVMGraph 0.00/0.12 Init Location: 0 0.00/0.12 Transitions: 0.00/0.12 0.00/0.12 0.00/0.12 0.00/0.12 (1 + walker^0), z^0 -> (~(1) + z^0)}> 0.00/0.12 (~(1) + walker^0), z^0 -> (~(1) + z^0)}> 0.00/0.12 (0 + undef40), seq^0 -> undef40, walker^0 -> (1 + walker^0), z^0 -> undef42}> 0.00/0.12 (0 + undef40), seq^0 -> undef40, walker^0 -> (~(1) + walker^0), z^0 -> undef42}> 0.00/0.12 (~(1) + i^0), walker^0 -> (~(1) + walker^0)}> 0.00/0.12 0.00/0.12 Fresh variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Undef variables: 0.00/0.12 undef29, undef33, undef35, undef40, undef42, undef72, 0.00/0.12 0.00/0.12 Abstraction variables: 0.00/0.12 0.00/0.12 Exit nodes: 0.00/0.12 0.00/0.12 Accepting locations: 0.00/0.12 0.00/0.12 Asserts: 0.00/0.12 0.00/0.12 ************************************************************* 0.00/0.12 ******************************************************************************************* 0.00/0.12 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.12 ******************************************************************************************* 0.00/0.12 0.00/0.12 Init Location: 0 0.00/0.12 Graph 0: 0.00/0.12 Transitions: 0.00/0.12 Variables: 0.00/0.12 0.00/0.12 Graph 1: 0.00/0.12 Transitions: 0.00/0.12 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> 0.00/0.12 -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> 0.00/0.12 undef40, seq^0 -> undef40, walker^0 -> 1 + walker^0, z^0 -> undef42, rest remain the same}> 0.00/0.12 undef40, seq^0 -> undef40, walker^0 -> -1 + walker^0, z^0 -> undef42, rest remain the same}> 0.00/0.12 -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}> 0.00/0.12 Variables: 0.00/0.12 N^0, seq^0, walker^0, z^0, i^0 0.00/0.12 0.00/0.12 Graph 2: 0.00/0.12 Transitions: 0.00/0.12 Variables: 0.00/0.12 0.00/0.12 Precedence: 0.00/0.12 Graph 0 0.00/0.12 0.00/0.12 Graph 1 0.00/0.12 0.00/0.12 0.00/0.12 Graph 2 0.00/0.12 0.00/0.12 0.00/0.12 0.00/0.12 Map Locations to Subgraph: 0.00/0.12 ( 0 , 0 ) 0.00/0.12 ( 2 , 2 ) 0.00/0.12 ( 4 , 1 ) 0.00/0.12 0.00/0.12 ******************************************************************************************* 0.00/0.12 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.12 ******************************************************************************************* 0.00/0.12 0.00/0.12 Proving termination of subgraph 0 0.00/0.12 Proving termination of subgraph 1 0.00/0.12 Checking unfeasibility... 0.00/0.12 Time used: 0.060105 0.00/0.12 0.00/0.12 Checking conditional termination of SCC {l4}... 0.00/0.12 0.00/0.12 LOG: CALL solveLinear 0.00/0.12 0.00/0.12 LOG: RETURN solveLinear - Elapsed time: 0.008043s 0.00/0.12 Ranking function: 6*N^0 - 6*seq^0 0.00/0.12 New Graphs: 0.00/0.12 Transitions: 0.00/0.12 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> 0.00/0.12 -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> 0.00/0.12 -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}> 0.00/0.12 Variables: 0.00/0.12 N^0, i^0, seq^0, walker^0, z^0 0.00/0.12 Checking conditional termination of SCC {l4}... 0.00/0.12 0.00/0.12 LOG: CALL solveLinear 0.00/0.12 0.00/0.12 LOG: RETURN solveLinear - Elapsed time: 0.002880s 0.00/0.12 Ranking function: -6 + 6*z^0 0.00/0.12 New Graphs: 0.00/0.12 Transitions: 0.00/0.12 -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}> 0.00/0.12 Variables: 0.00/0.12 N^0, i^0, seq^0, walker^0, z^0 0.00/0.12 Checking conditional termination of SCC {l4}... 0.00/0.12 0.00/0.12 LOG: CALL solveLinear 0.00/0.12 0.00/0.12 LOG: RETURN solveLinear - Elapsed time: 0.001212s 0.00/0.12 Ranking function: -1 + i^0 0.00/0.12 New Graphs: 0.00/0.12 Proving termination of subgraph 2 0.00/0.12 Analyzing SCC {l2}... 0.00/0.12 No cycles found. 0.00/0.12 0.00/0.12 Program Terminates 0.00/0.12 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.12 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.12 EOF