8.47/8.54	YES
8.47/8.54	
8.47/8.54	Solver Timeout: 4
8.47/8.54	Global Timeout: 300
8.47/8.54	No parsing errors!
8.47/8.54	Init Location: 0
8.47/8.54	Transitions:
8.47/8.54	<l0, l6, true>
8.47/8.54	<l1, l2, ((0 + op2^0) <= 0) /\ (0 <= (0 + op2^0)) /\ (0 <= (0 + op1^0))>
8.47/8.54	<l3, l4, (1 <= (0 + op2^0)), par{op1^0 -> (1 + op1^0), op2^0 -> (~(1) + op2^0)}>
8.47/8.54	<l4, l3, true>
8.47/8.54	<l3, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
8.47/8.54	<l5, l3, (1 <= (0 + op2^0)), par{op2^0 -> (~(1) + op2^0)}>
8.47/8.54	<l5, l2, true>
8.47/8.54	<l2, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
8.47/8.54	<l6, l1, true>
8.47/8.54	
8.47/8.54	Fresh variables:
8.47/8.54	
8.47/8.54	Undef variables:
8.47/8.54	
8.47/8.54	Abstraction variables:
8.47/8.54	
8.47/8.54	Exit nodes:
8.47/8.54	
8.47/8.54	Accepting locations:
8.47/8.54	
8.47/8.54	Asserts:
8.47/8.54	
8.47/8.54	Preprocessed LLVMGraph
8.47/8.54	Init Location: 0
8.47/8.54	Transitions:
8.47/8.54	<l0, l5, ((0 + op2^0) <= 0) /\ (0 <= (0 + op2^0)) /\ (0 <= (0 + op1^0)) /\ (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
8.47/8.54	<l3, l3, (1 <= (0 + op2^0)), par{op1^0 -> (1 + op1^0), op2^0 -> (~(1) + op2^0)}>
8.47/8.54	<l3, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
8.47/8.54	<l5, l3, (1 <= (0 + op2^0)), par{op2^0 -> (~(1) + op2^0)}>
8.47/8.54	<l5, l5, (1 <= (0 + op1^0)), par{op1^0 -> (~(1) + op1^0), op2^0 -> (1 + op2^0)}>
8.47/8.54	
8.47/8.54	Fresh variables:
8.47/8.54	
8.47/8.54	Undef variables:
8.47/8.54	
8.47/8.54	Abstraction variables:
8.47/8.54	
8.47/8.54	Exit nodes:
8.47/8.54	
8.47/8.54	Accepting locations:
8.47/8.54	
8.47/8.54	Asserts:
8.47/8.54	
8.47/8.54	*************************************************************
8.47/8.54	*******************************************************************************************
8.47/8.54	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
8.47/8.54	*******************************************************************************************
8.47/8.54	
8.47/8.54	Init Location: 0
8.47/8.54	Graph 0:
8.47/8.54	Transitions:
8.47/8.54	Variables:
8.47/8.54	
8.47/8.54	Graph 1:
8.47/8.54	Transitions:
8.47/8.54	<l3, l3, 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	<l3, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	<l5, l3, 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	<l5, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	Variables:
8.47/8.54	op1^0, op2^0
8.47/8.54	
8.47/8.54	Precedence: 
8.47/8.54	Graph 0
8.47/8.54	
8.47/8.54	Graph 1
8.47/8.54	<l0, l5, 1 <= op1^0 /\ op2^0 = 0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	Map Locations to Subgraph:
8.47/8.54	( 0 , 0 )
8.47/8.54	( 3 , 1 )
8.47/8.54	( 5 , 1 )
8.47/8.54	
8.47/8.54	*******************************************************************************************
8.47/8.54	********************************    CHECKING ASSERTIONS    ********************************
8.47/8.54	*******************************************************************************************
8.47/8.54	
8.47/8.54	Proving termination of subgraph 0
8.47/8.54	Proving termination of subgraph 1
8.47/8.54	Checking unfeasibility...
8.47/8.54	Time used: 0.010903
8.47/8.54	
8.47/8.54	Checking conditional termination of SCC {l3, l5}...
8.47/8.54	
8.47/8.54	LOG: CALL solveLinear
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear - Elapsed time: 0.001344s
8.47/8.54	
8.47/8.54	LOG: CALL solveLinear
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear - Elapsed time: 0.010675s
8.47/8.54	Trying to remove transition: <l5, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	Solving with 1 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020092s
8.47/8.54	Time used: 0.01983
8.47/8.54	Trying to remove transition: <l5, l3, 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	Solving with 1 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010897s
8.47/8.54	Time used: 0.010007
8.47/8.54	Trying to remove transition: <l3, l5, 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	Solving with 1 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016089s
8.47/8.54	Time used: 0.015527
8.47/8.54	Trying to remove transition: <l3, l3, 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	Solving with 1 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013703s
8.47/8.54	Time used: 0.012872
8.47/8.54	Solving with 1 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001620s
8.47/8.54	Time used: 4.00026
8.47/8.54	Solving with 2 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015342s
8.47/8.54	Time used: 4.00002
8.47/8.54	Solving with 3 template(s).
8.47/8.54	
8.47/8.54	LOG: CALL solveNonLinearGetFirstSolution
8.47/8.54	
8.47/8.54	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.352933s
8.47/8.54	Time used: 0.325875
8.47/8.54	
8.47/8.54	LOG: SAT solveNonLinear - Elapsed time: 0.352933s
8.47/8.54	Cost: 0; Total time: 0.325875
8.47/8.54	Termination implied by a set of invariant(s):
8.47/8.54	Invariant at l3: 0 <= op2^0
8.47/8.54	Invariant at l3: 0 <= 1 + op1^0 + op2^0
8.47/8.54	Invariant at l3: 0 <= op1^0 + op2^0
8.47/8.54	Invariant at l5: 1 <= op1^0 + op2^0
8.47/8.54	Invariant at l5: 0 <= 1 + op1^0 + op2^0
8.47/8.54	Invariant at l5: 1 <= op2^0
8.47/8.54	[ Invariant Graph ]
8.47/8.54	Strengthening and disabling transitions...
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l3, l3, 0 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l3, l5, 0 <= op1^0 + op2^0 /\ 0 <= op2^0 /\ 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l5, l3, 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	[ Termination Graph ]
8.47/8.54	Strengthening and disabling transitions...
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l3, l3, 0 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l3, l5, 0 <= op1^0 + op2^0 /\ 0 <= op2^0 /\ 1 <= op1^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l5, l3, 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	
8.47/8.54	LOG: CALL solverLinear in Graph for feasibility
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear in Graph for feasibility
8.47/8.54	Strengthening transition (result): 
8.47/8.54	<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	Ranking function: 2 + 2*op1^0 + 2*op2^0
8.47/8.54	New Graphs: 
8.47/8.54	Transitions:
8.47/8.54	<l3, l3, 0 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> 1 + op1^0, op2^0 -> -1 + op2^0, rest remain the same}>
8.47/8.54	Variables:
8.47/8.54	op1^0, op2^0
8.47/8.54	Transitions:
8.47/8.54	<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	Variables:
8.47/8.54	op1^0, op2^0
8.47/8.54	Checking conditional termination of SCC {l3}...
8.47/8.54	
8.47/8.54	LOG: CALL solveLinear
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear - Elapsed time: 0.000909s
8.47/8.54	Ranking function: -1 + op2^0
8.47/8.54	New Graphs: 
8.47/8.54	Transitions:
8.47/8.54	<l5, l5, 1 <= op1^0 /\ 1 <= op1^0 + op2^0 /\ 1 <= op2^0, {op1^0 -> -1 + op1^0, op2^0 -> 1 + op2^0, rest remain the same}>
8.47/8.54	Variables:
8.47/8.54	op1^0, op2^0
8.47/8.54	Checking conditional termination of SCC {l5}...
8.47/8.54	
8.47/8.54	LOG: CALL solveLinear
8.47/8.54	
8.47/8.54	LOG: RETURN solveLinear - Elapsed time: 0.001008s
8.47/8.54	Ranking function: -1 + op1^0
8.47/8.54	New Graphs: 
8.47/8.54	INVARIANTS: 
8.47/8.54	3: 0 <= op1^0 + op2^0 , 0 <= op2^0 , 0 <= 1 + op1^0 + op2^0 , 
8.47/8.54	5: 1 <= op1^0 + op2^0 , 1 <= op2^0 , 0 <= 1 + op1^0 + op2^0 , 
8.47/8.54	Quasi-INVARIANTS to narrow Graph: 
8.47/8.54	3: 
8.47/8.54	5: 
8.47/8.54	Program Terminates
8.47/8.54	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
8.47/8.54	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
8.47/8.54	EOF