0.00/0.11 YES 0.00/0.11 0.00/0.11 Solver Timeout: 4 0.00/0.11 Global Timeout: 300 0.00/0.11 No parsing errors! 0.00/0.11 Init Location: 0 0.00/0.11 Transitions: 0.00/0.11 0.00/0.11 ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (undef9 > undef2) /\ (undef9 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6, arg7 -> undef7}> 0.00/0.11 ~(1)) /\ (arg2 > 1) /\ (undef11 < 1) /\ (undef10 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12, arg4 -> undef13, arg5 -> undef14, arg6 -> undef15, arg7 -> undef16}> 0.00/0.11 0), par{arg2 -> 0, arg3 -> arg2, arg4 -> arg2, arg5 -> 0, arg6 -> arg2, arg7 -> arg2}> 0.00/0.11 0) /\ (arg4 > 0) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg2) /\ (undef33 > arg6) /\ (arg6 < arg3) /\ (undef32 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (undef34 < arg4) /\ (arg7 < arg4) /\ ((arg1 - (2 * undef35)) = 0) /\ (undef32 > undef36) /\ (undef33 > 0) /\ (arg2 > 0) /\ (arg1 >= undef37) /\ (undef38 < arg5)> 0.00/0.11 0) /\ (arg4 > 0) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg2) /\ (undef47 > arg6) /\ (arg6 < arg3) /\ (undef46 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (undef42 < arg4) /\ (arg7 < arg4) /\ ((arg1 - (2 * undef48)) = 0) /\ (undef46 > undef45) /\ (undef47 > 0) /\ (arg2 > 0) /\ (undef43 < arg5) /\ (arg1 >= undef39) /\ ((arg1 - (2 * undef48)) >= 0) /\ ((arg1 - (2 * undef48)) < 2) /\ ((arg1 - (2 * undef39)) < 2) /\ ((arg1 - (2 * undef39)) >= 0), par{arg1 -> undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45}> 0.00/0.11 ~(1)) /\ (arg3 > 0) /\ (arg6 < arg2) /\ (undef56 > arg6) /\ (arg6 < arg3) /\ (undef56 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef57)) = 0) /\ (undef58 < arg3) /\ (undef56 > undef59) /\ (undef56 > ~(1)) /\ (arg1 >= undef60) /\ (arg3 = arg4), par{arg4 -> arg3}> 0.00/0.11 ~(1)) /\ (arg3 > 0) /\ (arg6 < arg2) /\ (undef68 > arg6) /\ (arg6 < arg3) /\ (undef68 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef69)) = 0) /\ (undef64 < arg3) /\ (undef68 > undef65) /\ (arg1 >= undef61) /\ (undef68 > ~(1)) /\ ((arg1 - (2 * undef69)) >= 0) /\ ((arg1 - (2 * undef69)) < 2) /\ ((arg1 - (2 * undef61)) < 2) /\ ((arg1 - (2 * undef61)) >= 0) /\ (arg3 = arg4), par{arg1 -> undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65}> 0.00/0.11 ~(1)) /\ (arg2 > 1) /\ (undef78 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef78 - 1), arg2 -> undef71, arg3 -> undef72, arg4 -> undef73, arg5 -> undef74, arg6 -> undef75, arg7 -> undef76}> 0.00/0.11 0), par{arg1 -> (arg1 - 1), arg2 -> undef80, arg3 -> undef81, arg4 -> undef82, arg5 -> undef83, arg6 -> undef84, arg7 -> undef85}> 0.00/0.11 undef86, arg2 -> undef87, arg3 -> undef88, arg4 -> undef89, arg5 -> undef90, arg6 -> undef91, arg7 -> undef92}> 0.00/0.11 0.00/0.11 Fresh variables: 0.00/0.11 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef42, undef43, undef45, undef46, undef47, undef48, undef56, undef57, undef58, undef59, undef60, undef61, undef63, undef64, undef65, undef68, undef69, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, 0.00/0.11 0.00/0.11 Undef variables: 0.00/0.11 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef42, undef43, undef45, undef46, undef47, undef48, undef56, undef57, undef58, undef59, undef60, undef61, undef63, undef64, undef65, undef68, undef69, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, 0.00/0.11 0.00/0.11 Abstraction variables: 0.00/0.11 0.00/0.11 Exit nodes: 0.00/0.11 0.00/0.11 Accepting locations: 0.00/0.11 0.00/0.11 Asserts: 0.00/0.11 0.00/0.11 Preprocessed LLVMGraph 0.00/0.11 Init Location: 0 0.00/0.11 Transitions: 0.00/0.11 ~(1)) /\ (undef87 > 1) /\ (undef1 > ~(1)) /\ (undef9 > undef2) /\ (undef9 > ~(1)) /\ (undef86 > 0) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> undef2, arg4 -> undef2, arg5 -> 0, arg6 -> undef2, arg7 -> undef2}> 0.00/0.11 ~(1)) /\ (undef87 > 1) /\ (undef78 > ~(1)) /\ (undef86 > 0), par{arg1 -> (undef78 - 1), arg2 -> undef71, arg3 -> undef72, arg4 -> undef73, arg5 -> undef74, arg6 -> undef75, arg7 -> undef76}> 0.00/0.11 0) /\ (arg4 > 0) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg2) /\ (undef33 > arg6) /\ (arg6 < arg3) /\ (undef32 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (undef34 < arg4) /\ (arg7 < arg4) /\ ((arg1 - (2 * undef35)) = 0) /\ (undef32 > undef36) /\ (undef33 > 0) /\ (arg2 > 0) /\ (arg1 >= undef37) /\ (undef38 < arg5) /\ (undef46 > 0) /\ (arg4 > 0) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg2) /\ (undef47 > arg6) /\ (arg6 < arg3) /\ (undef46 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (undef42 < arg4) /\ (arg7 < arg4) /\ ((arg1 - (2 * undef48)) = 0) /\ (undef46 > undef45) /\ (undef47 > 0) /\ (arg2 > 0) /\ (undef43 < arg5) /\ (arg1 >= undef39) /\ ((arg1 - (2 * undef48)) >= 0) /\ ((arg1 - (2 * undef48)) < 2) /\ ((arg1 - (2 * undef39)) < 2) /\ ((arg1 - (2 * undef39)) >= 0), par{arg1 -> undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45}> 0.00/0.11 0) /\ (arg4 > 0) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg2) /\ (undef33 > arg6) /\ (arg6 < arg3) /\ (undef32 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (undef34 < arg4) /\ (arg7 < arg4) /\ ((arg1 - (2 * undef35)) = 0) /\ (undef32 > undef36) /\ (undef33 > 0) /\ (arg2 > 0) /\ (arg1 >= undef37) /\ (undef38 < arg5) /\ (arg6 > ~(1)) /\ (arg3 > 0) /\ (arg6 < arg2) /\ (undef68 > arg6) /\ (arg6 < arg3) /\ (undef68 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef69)) = 0) /\ (undef64 < arg3) /\ (undef68 > undef65) /\ (arg1 >= undef61) /\ (undef68 > ~(1)) /\ ((arg1 - (2 * undef69)) >= 0) /\ ((arg1 - (2 * undef69)) < 2) /\ ((arg1 - (2 * undef61)) < 2) /\ ((arg1 - (2 * undef61)) >= 0) /\ (arg3 = arg4), par{arg1 -> undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65}> 0.00/0.11 ~(1)) /\ (arg3 > 0) /\ (arg6 < arg2) /\ (undef56 > arg6) /\ (arg6 < arg3) /\ (undef56 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef57)) = 0) /\ (undef58 < arg3) /\ (undef56 > undef59) /\ (undef56 > ~(1)) /\ (arg1 >= undef60) /\ (arg3 = arg4) /\ (undef46 > 0) /\ (arg3 > 0) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg2) /\ (undef47 > arg6) /\ (arg6 < arg3) /\ (undef46 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (undef42 < arg3) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef48)) = 0) /\ (undef46 > undef45) /\ (undef47 > 0) /\ (arg2 > 0) /\ (undef43 < arg5) /\ (arg1 >= undef39) /\ ((arg1 - (2 * undef48)) >= 0) /\ ((arg1 - (2 * undef48)) < 2) /\ ((arg1 - (2 * undef39)) < 2) /\ ((arg1 - (2 * undef39)) >= 0), par{arg1 -> undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45}> 0.00/0.11 ~(1)) /\ (arg3 > 0) /\ (arg6 < arg2) /\ (undef56 > arg6) /\ (arg6 < arg3) /\ (undef56 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef57)) = 0) /\ (undef58 < arg3) /\ (undef56 > undef59) /\ (undef56 > ~(1)) /\ (arg1 >= undef60) /\ (arg3 = arg4) /\ (arg6 > ~(1)) /\ (arg3 > 0) /\ (arg6 < arg2) /\ (undef68 > arg6) /\ (arg6 < arg3) /\ (undef68 > arg7) /\ (arg7 > ~(1)) /\ (arg7 < arg5) /\ (arg7 < arg3) /\ ((arg1 - (2 * undef69)) = 0) /\ (undef64 < arg3) /\ (undef68 > undef65) /\ (arg1 >= undef61) /\ (undef68 > ~(1)) /\ ((arg1 - (2 * undef69)) >= 0) /\ ((arg1 - (2 * undef69)) < 2) /\ ((arg1 - (2 * undef61)) < 2) /\ ((arg1 - (2 * undef61)) >= 0) /\ (arg3 = arg3), par{arg1 -> undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65}> 0.00/0.11 0), par{arg1 -> (arg1 - 1), arg2 -> undef80, arg3 -> undef81, arg4 -> undef82, arg5 -> undef83, arg6 -> undef84, arg7 -> undef85}> 0.00/0.11 0.00/0.11 Fresh variables: 0.00/0.11 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef42, undef43, undef45, undef46, undef47, undef48, undef56, undef57, undef58, undef59, undef60, undef61, undef63, undef64, undef65, undef68, undef69, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, 0.00/0.11 0.00/0.11 Undef variables: 0.00/0.11 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef42, undef43, undef45, undef46, undef47, undef48, undef56, undef57, undef58, undef59, undef60, undef61, undef63, undef64, undef65, undef68, undef69, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, 0.00/0.11 0.00/0.11 Abstraction variables: 0.00/0.11 0.00/0.11 Exit nodes: 0.00/0.11 0.00/0.11 Accepting locations: 0.00/0.11 0.00/0.11 Asserts: 0.00/0.11 0.00/0.11 ************************************************************* 0.00/0.11 ******************************************************************************************* 0.00/0.11 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.11 ******************************************************************************************* 0.00/0.11 0.00/0.11 Init Location: 0 0.00/0.11 Graph 0: 0.00/0.11 Transitions: 0.00/0.11 Variables: 0.00/0.11 0.00/0.11 Graph 1: 0.00/0.11 Transitions: 0.00/0.11 -1 + arg1, arg2 -> undef80, arg3 -> undef81, arg4 -> undef82, arg5 -> undef83, arg6 -> undef84, arg7 -> undef85, rest remain the same}> 0.00/0.11 Variables: 0.00/0.11 arg1, arg2, arg3, arg4, arg5, arg6, arg7 0.00/0.11 0.00/0.11 Graph 2: 0.00/0.11 Transitions: 0.00/0.11 undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45, rest remain the same}> 0.00/0.11 undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65, rest remain the same}> 0.00/0.11 undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45, rest remain the same}> 0.00/0.11 undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65, rest remain the same}> 0.00/0.11 Variables: 0.00/0.11 arg1, arg2, arg3, arg4, arg5, arg6, arg7 0.00/0.11 0.00/0.11 Precedence: 0.00/0.11 Graph 0 0.00/0.11 0.00/0.11 Graph 1 0.00/0.11 -1 + undef78, arg2 -> undef71, arg3 -> undef72, arg4 -> undef73, arg5 -> undef74, arg6 -> undef75, arg7 -> undef76, rest remain the same}> 0.00/0.11 0.00/0.11 Graph 2 0.00/0.11 undef1, arg2 -> 0, arg3 -> undef2, arg4 -> undef2, arg5 -> 0, arg6 -> undef2, arg7 -> undef2, rest remain the same}> 0.00/0.11 0.00/0.11 Map Locations to Subgraph: 0.00/0.11 ( 0 , 0 ) 0.00/0.11 ( 3 , 2 ) 0.00/0.11 ( 5 , 1 ) 0.00/0.11 0.00/0.11 ******************************************************************************************* 0.00/0.11 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.11 ******************************************************************************************* 0.00/0.11 0.00/0.11 Proving termination of subgraph 0 0.00/0.11 Proving termination of subgraph 1 0.00/0.11 Checking unfeasibility... 0.00/0.11 Time used: 0.004305 0.00/0.11 0.00/0.11 Checking conditional termination of SCC {l5}... 0.00/0.11 0.00/0.11 LOG: CALL solveLinear 0.00/0.11 0.00/0.11 LOG: RETURN solveLinear - Elapsed time: 0.001029s 0.00/0.11 Ranking function: -1 + arg1 0.00/0.11 New Graphs: 0.00/0.11 Proving termination of subgraph 2 0.00/0.11 Checking unfeasibility... 0.00/0.11 Time used: 0.037567 0.00/0.11 Some transition disabled by a set of invariant(s): 0.00/0.11 Invariant at l3: arg5 <= 0 0.00/0.11 0.00/0.11 Strengthening and disabling transitions... 0.00/0.11 > It's unfeasible. Removing transition: 0.00/0.11 undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65, rest remain the same}> 0.00/0.11 > It's unfeasible. Removing transition: 0.00/0.11 undef61, arg2 -> 1, arg3 -> undef63, arg4 -> undef64, arg5 -> undef65, arg6 -> 0, arg7 -> undef65, rest remain the same}> 0.00/0.11 0.00/0.11 LOG: CALL solverLinear in Graph for feasibility 0.00/0.11 0.00/0.11 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.11 It's unfeasible. Removing transition: 0.00/0.11 undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45, rest remain the same}> 0.00/0.11 0.00/0.11 LOG: CALL solverLinear in Graph for feasibility 0.00/0.11 0.00/0.11 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.11 It's unfeasible. Removing transition: 0.00/0.11 undef39, arg2 -> undef40, arg4 -> undef42, arg5 -> undef43, arg6 -> arg2, arg7 -> undef45, rest remain the same}> 0.00/0.11 Checking unfeasibility... 0.00/0.11 Time used: 4.9e-05 0.00/0.11 0.00/0.11 Analyzing SCC {l3}... 0.00/0.11 No cycles found. 0.00/0.11 0.00/0.11 Program Terminates 0.00/0.11 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.11 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.11 EOF