33.46/33.51	NO
33.46/33.51	
33.46/33.51	Solver Timeout: 4
33.46/33.51	Global Timeout: 300
33.46/33.51	No parsing errors!
33.46/33.51	Init Location: 0
33.46/33.51	Transitions:
33.46/33.51	<l0, l5, true>
33.46/33.51	<l1, l2, true, par{x^0 -> (~(1) + x^0)}>
33.46/33.51	<l2, l1, true>
33.46/33.51	<l1, l3, (undef3 = (~(1) + x^0)) /\ (1 <= (0 + undef3)), par{x^0 -> undef3}>
33.46/33.51	<l3, l1, true>
33.46/33.51	<l4, l1, true>
33.46/33.51	<l5, l4, true>
33.46/33.51	
33.46/33.51	Fresh variables:
33.46/33.51	undef3, 
33.46/33.51	
33.46/33.51	Undef variables:
33.46/33.51	undef3, 
33.46/33.51	
33.46/33.51	Abstraction variables:
33.46/33.51	
33.46/33.51	Exit nodes:
33.46/33.51	
33.46/33.51	Accepting locations:
33.46/33.51	
33.46/33.51	Asserts:
33.46/33.51	
33.46/33.51	Preprocessed LLVMGraph
33.46/33.51	Init Location: 0
33.46/33.51	Transitions:
33.46/33.51	<l0, l1, true>
33.46/33.51	<l1, l1, true, par{x^0 -> (~(1) + x^0)}>
33.46/33.51	<l1, l1, (undef3 = (~(1) + x^0)) /\ (1 <= (0 + undef3)), par{x^0 -> undef3}>
33.46/33.51	
33.46/33.51	Fresh variables:
33.46/33.51	undef3, 
33.46/33.51	
33.46/33.51	Undef variables:
33.46/33.51	undef3, 
33.46/33.51	
33.46/33.51	Abstraction variables:
33.46/33.51	
33.46/33.51	Exit nodes:
33.46/33.51	
33.46/33.51	Accepting locations:
33.46/33.51	
33.46/33.51	Asserts:
33.46/33.51	
33.46/33.51	*************************************************************
33.46/33.51	*******************************************************************************************
33.46/33.51	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
33.46/33.51	*******************************************************************************************
33.46/33.51	
33.46/33.51	Init Location: 0
33.46/33.51	Graph 0:
33.46/33.51	Transitions:
33.46/33.51	Variables:
33.46/33.51	
33.46/33.51	Graph 1:
33.46/33.51	Transitions:
33.46/33.51	<l1, l1, true, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	<l1, l1, 1 <= undef3 /\ x^0 = 1 + undef3, {x^0 -> undef3, rest remain the same}>
33.46/33.51	Variables:
33.46/33.51	x^0
33.46/33.51	
33.46/33.51	Precedence: 
33.46/33.51	Graph 0
33.46/33.51	
33.46/33.51	Graph 1
33.46/33.51	<l0, l1, true, {all remain the same}>
33.46/33.51	
33.46/33.51	Map Locations to Subgraph:
33.46/33.51	( 0 , 0 )
33.46/33.51	( 1 , 1 )
33.46/33.51	
33.46/33.51	*******************************************************************************************
33.46/33.51	********************************    CHECKING ASSERTIONS    ********************************
33.46/33.51	*******************************************************************************************
33.46/33.51	
33.46/33.51	Proving termination of subgraph 0
33.46/33.51	Proving termination of subgraph 1
33.46/33.51	Checking unfeasibility...
33.46/33.51	Time used: 0.002365
33.46/33.51	
33.46/33.51	Checking conditional termination of SCC {l1}...
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.000935s
33.46/33.51	Ranking function: -1 + x^0
33.46/33.51	New Graphs: 
33.46/33.51	Transitions:
33.46/33.51	<l1, l1, true, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	Variables:
33.46/33.51	x^0
33.46/33.51	Checking conditional termination of SCC {l1}...
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.000422s
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.000875s
33.46/33.51	Trying to remove transition: <l1, l1, true, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003126s
33.46/33.51	Time used: 0.003015
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001509s
33.46/33.51	Time used: 4.00103
33.46/33.51	Solving with 2 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007408s
33.46/33.51	Time used: 4.00137
33.46/33.51	Solving with 3 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018295s
33.46/33.51	Time used: 1.01257
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009993s
33.46/33.51	Time used: 0.0061
33.46/33.51	Improving Solution with cost 1 ...
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetNextSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008894s
33.46/33.51	Time used: 0.008889
33.46/33.51	
33.46/33.51	LOG: SAT solveNonLinear - Elapsed time: 0.018887s
33.46/33.51	Cost: 1; Total time: 0.014989
33.46/33.51	Quasi-ranking function: 50000 + x^0
33.46/33.51	New Graphs: 
33.46/33.51	Transitions:
33.46/33.51	<l1, l1, 50001 + x^0 <= 0, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	Variables:
33.46/33.51	x^0
33.46/33.51	Checking conditional termination of SCC {l1}...
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.000404s
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.001213s
33.46/33.51	Trying to remove transition: <l1, l1, 50001 + x^0 <= 0, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003534s
33.46/33.51	Time used: 0.003408
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004381s
33.46/33.51	Time used: 4.00391
33.46/33.51	Solving with 2 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007104s
33.46/33.51	Time used: 4.00085
33.46/33.51	Solving with 3 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010813s
33.46/33.51	Time used: 1.00498
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009220s
33.46/33.51	Time used: 0.004874
33.46/33.51	Termination failed. Trying to show unreachability...
33.46/33.51	Proving unreachability of entry: <l0, l1, true, {all remain the same}>
33.46/33.51	
33.46/33.51	LOG: CALL check - Post:1 <= 0 - Process 1
33.46/33.51	* Exit transition: <l0, l1, true, {all remain the same}>
33.46/33.51	* Postcondition  : 1 <= 0
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.000815s
33.46/33.51	> Postcondition is not implied!
33.46/33.51	
33.46/33.51	LOG: RETURN check - Elapsed time: 0.000874s
33.46/33.51	Cannot prove unreachability
33.46/33.51	
33.46/33.51	Proving non-termination of subgraph 1
33.46/33.51	Transitions:
33.46/33.51	<l1, l1, true, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	<l1, l1, 1 <= undef3 /\ x^0 = 1 + undef3, {x^0 -> undef3, rest remain the same}>
33.46/33.51	Variables:
33.46/33.51	x^0
33.46/33.51	
33.46/33.51	Checking conditional non-termination of SCC {l1}...
33.46/33.51	> No exit transition to close.
33.46/33.51	Checking that every undef value has an assignment...
33.46/33.51	
33.46/33.51	LOG: CALL solveLinear
33.46/33.51	
33.46/33.51	LOG: RETURN solveLinear - Elapsed time: 0.000708s
33.46/33.51	> No assignment for some undef value.
33.46/33.51	
33.46/33.51	Proving non-termination of subgraph 1
33.46/33.51	Transitions:
33.46/33.51	<l1, l1, 50001 + x^0 <= 0, {x^0 -> -1 + x^0, rest remain the same}>
33.46/33.51	Variables:
33.46/33.51	x^0
33.46/33.51	
33.46/33.51	Checking conditional non-termination of SCC {l1}...
33.46/33.51	EXIT TRANSITIONS:
33.46/33.51	<l1, end, 0 <= 50000 + x^0, {all remain the same}>
33.46/33.51	
33.46/33.51	Solving with 1 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.202486s
33.46/33.51	Time used: 5.20192
33.46/33.51	Solving with 2 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.038215s
33.46/33.51	Time used: 5.01633
33.46/33.51	Solving with 3 template(s).
33.46/33.51	
33.46/33.51	LOG: CALL solveNonLinearGetFirstSolution
33.46/33.51	
33.46/33.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.011360s
33.46/33.51	Time used: 5.00264
33.46/33.51	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
33.46/33.51	Calling reachability with...
33.46/33.51	Transition: <l1, end, true, {all remain the same}>
33.46/33.51	Conditions: 50001 + x^0 <= 0, 
33.46/33.51	OPEN EXITS: 
33.46/33.51	<l1, end, 50001 + x^0 <= 0, {all remain the same}>
33.46/33.51	
33.46/33.51	--- Reachability graph ---
33.46/33.51	> Graph without transitions.
33.46/33.51	
33.46/33.51	Calling reachability with...
33.46/33.51	Transition: <l0, l1, true, {all remain the same}>
33.46/33.51	Conditions: 50001 + x^0 <= 0, 
33.46/33.51	OPEN EXITS: 
33.46/33.51	<l0, l1, 50001 + x^0 <= 0, {all remain the same}>
33.46/33.51	
33.46/33.51	> Conditions are reachable!
33.46/33.51	
33.46/33.51	Program does NOT terminate
33.46/33.51	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
33.46/33.51	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
33.46/33.51	EOF