/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l43, true>
<l1, l2, ((0 + ip^0) <= (0 + j^0))>
<l1, l3, ((0 + j^0) <= (~(1) + ip^0)) /\ (undef29 = undef29) /\ (undef30 = undef30), par{g^0 -> undef29, h^0 -> undef30, j^0 -> (1 + j^0)}>
<l4, l5, true>
<l6, l7, (0 <= (0 + theta^0))>
<l6, l7, ((1 + theta^0) <= 0), par{t^0 -> (0 + (~(1) * t^0))}>
<l8, l6, (undef148 = undef148) /\ (undef154 = undef154) /\ (undef155 = undef155) /\ (undef146 = undef146), par{t^0 -> undef146, theta^0 -> undef148, tmp___2^0 -> undef154, tmp___3^0 -> undef155}>
<l7, l3, (undef185 = undef185) /\ (undef163 = undef163) /\ (undef171 = undef171) /\ (undef174 = undef174) /\ (undef165 = undef165), par{c^0 -> undef163, h^0 -> undef165, s^0 -> undef171, tau^0 -> undef174, tmp___6^0 -> undef185}>
<l9, l10, true>
<l11, l8, ((1 + tmp___5^0) <= ((0 + g^0) + tmp___4^0))>
<l11, l8, (((1 + g^0) + tmp___4^0) <= (0 + tmp___5^0))>
<l11, l7, (((0 + g^0) + tmp___4^0) <= (0 + tmp___5^0)) /\ ((0 + tmp___5^0) <= ((0 + g^0) + tmp___4^0)) /\ (undef281 = undef281), par{t^0 -> undef281}>
<l12, l13, ((0 + tmp___7^0) <= (0 + tresh^0))>
<l12, l11, ((1 + tresh^0) <= (0 + tmp___7^0)) /\ (undef327 = undef327) /\ (undef345 = undef345) /\ (undef346 = undef346), par{h^0 -> undef327, tmp___4^0 -> undef345, tmp___5^0 -> undef346}>
<l14, l12, (undef375 = undef375), par{tmp___7^0 -> undef375}>
<l15, l14, true>
<l16, l14, true>
<l13, l17, true, par{iq^0 -> (1 + iq^0)}>
<l17, l18, true>
<l19, l16, ((1 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
<l19, l16, (((1 + g^0) + tmp___10^0) <= (0 + tmp___11^0))>
<l19, l13, (((0 + g^0) + tmp___10^0) <= (0 + tmp___11^0)) /\ ((0 + tmp___11^0) <= ((0 + g^0) + tmp___10^0))>
<l20, l15, ((1 + tmp___9^0) <= ((0 + g^0) + tmp___8^0))>
<l20, l15, (((1 + g^0) + tmp___8^0) <= (0 + tmp___9^0))>
<l20, l19, (((0 + g^0) + tmp___8^0) <= (0 + tmp___9^0)) /\ ((0 + tmp___9^0) <= ((0 + g^0) + tmp___8^0)) /\ (undef637 = undef637) /\ (undef638 = undef638), par{tmp___10^0 -> undef637, tmp___11^0 -> undef638}>
<l21, l14, ((0 + i^0) <= 4)>
<l21, l20, (5 <= (0 + i^0)) /\ (undef700 = undef700) /\ (undef701 = undef701), par{tmp___8^0 -> undef700, tmp___9^0 -> undef701}>
<l3, l1, true>
<l18, l9, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
<l18, l21, ((0 + iq^0) <= (0 + n^0)) /\ (undef774 = undef774) /\ (undef758 = undef758), par{g^0 -> undef758, tmp___1^0 -> undef774}>
<l10, l22, ((0 + n^0) <= (0 + ip^0))>
<l10, l17, ((0 + ip^0) <= (~(1) + n^0))>
<l23, l9, (4 <= (0 + i^0)), par{tresh^0 -> 0}>
<l23, l9, ((1 + i^0) <= 4) /\ (undef891 = undef891), par{tresh^0 -> undef891}>
<l2, l24, true>
<l25, l23, (1 <= (0 + sm^0))>
<l25, l23, ((1 + sm^0) <= 0)>
<l25, l26, ((0 + sm^0) <= 0) /\ (0 <= (0 + sm^0))>
<l5, l27, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
<l5, l4, ((0 + iq^0) <= (0 + n^0)) /\ (undef1041 = undef1041), par{iq^0 -> (1 + iq^0), sm^0 -> ((0 + sm^0) + undef1041), tmp___0^0 -> undef1041}>
<l28, l29, true>
<l30, l25, ((0 + n^0) <= (0 + ip^0))>
<l30, l4, ((0 + ip^0) <= (~(1) + n^0))>
<l31, l26, (51 <= (0 + i^0))>
<l31, l27, ((0 + i^0) <= 50), par{sm^0 -> 0}>
<l32, l33, true>
<l34, l35, ((1 + n^0) <= (0 + ip^0))>
<l34, l36, ((0 + ip^0) <= (0 + n^0)) /\ (undef1256 = undef1256), par{ip^0 -> (1 + ip^0), tmp^0 -> undef1256}>
<l22, l37, true>
<l38, l39, ((1 + n^0) <= (0 + iq^0)), par{ip^0 -> (1 + ip^0)}>
<l38, l40, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>
<l41, l36, ((1 + n^0) <= (0 + ip^0))>
<l41, l40, ((0 + ip^0) <= (0 + n^0))>
<l39, l41, true>
<l37, l35, ((1 + n^0) <= (0 + ip^0)), par{i^0 -> (1 + i^0)}>
<l37, l22, ((0 + ip^0) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
<l40, l38, true>
<l33, l13, ((1 + n^0) <= (0 + j^0))>
<l33, l32, ((0 + j^0) <= (0 + n^0)) /\ (undef1541 = undef1541) /\ (undef1542 = undef1542), par{g^0 -> undef1541, h^0 -> undef1542, j^0 -> (1 + j^0)}>
<l36, l34, true>
<l29, l32, ((1 + n^0) <= (0 + j^0))>
<l29, l28, ((0 + j^0) <= (0 + n^0)) /\ (undef1622 = undef1622) /\ (undef1623 = undef1623), par{g^0 -> undef1622, h^0 -> undef1623, j^0 -> (1 + j^0)}>
<l35, l31, true>
<l24, l28, ((0 + iq^0) <= (0 + j^0))>
<l24, l2, ((0 + j^0) <= (~(1) + iq^0)) /\ (undef1703 = undef1703) /\ (undef1704 = undef1704), par{g^0 -> undef1703, h^0 -> undef1704, j^0 -> (1 + j^0)}>
<l27, l30, true>
<l42, l39, true>
<l43, l42, true>

Fresh variables:
undef29, undef30, undef146, undef148, undef154, undef155, undef163, undef165, undef171, undef174, undef185, undef281, undef327, undef345, undef346, undef375, undef637, undef638, undef700, undef701, undef758, undef774, undef891, undef1041, undef1256, undef1541, undef1542, undef1622, undef1623, undef1703, undef1704, 

Undef variables:
undef29, undef30, undef146, undef148, undef154, undef155, undef163, undef165, undef171, undef174, undef185, undef281, undef327, undef345, undef346, undef375, undef637, undef638, undef700, undef701, undef758, undef774, undef891, undef1041, undef1256, undef1541, undef1542, undef1622, undef1623, undef1703, undef1704, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l36, ((1 + n^0) <= (0 + ip^0))>
<l0, l40, ((0 + ip^0) <= (0 + n^0))>
<l36, l26, ((1 + n^0) <= (0 + ip^0)) /\ (51 <= (0 + i^0))>
<l36, l26, ((1 + n^0) <= (0 + ip^0)) /\ ((0 + i^0) <= 50) /\ ((0 + n^0) <= (0 + ip^0)) /\ ((0 + 0) <= 0) /\ (0 <= (0 + 0)), par{sm^0 -> 0}>
<l36, l36, ((0 + ip^0) <= (0 + n^0)) /\ (undef1256 = undef1256), par{ip^0 -> (1 + ip^0)}>
<l40, l36, ((1 + n^0) <= (0 + iq^0)) /\ ((1 + n^0) <= (0 + (1 + ip^0))), par{ip^0 -> (1 + ip^0)}>
<l40, l40, ((1 + n^0) <= (0 + iq^0)) /\ ((0 + (1 + ip^0)) <= (0 + n^0)), par{ip^0 -> (1 + ip^0)}>
<l40, l40, ((0 + iq^0) <= (0 + n^0)), par{iq^0 -> (1 + iq^0)}>

Fresh variables:
undef29, undef30, undef146, undef148, undef154, undef155, undef163, undef165, undef171, undef174, undef185, undef281, undef327, undef345, undef346, undef375, undef637, undef638, undef700, undef701, undef758, undef774, undef891, undef1041, undef1256, undef1541, undef1542, undef1622, undef1623, undef1703, undef1704, 

Undef variables:
undef29, undef30, undef146, undef148, undef154, undef155, undef163, undef165, undef171, undef174, undef185, undef281, undef327, undef345, undef346, undef375, undef637, undef638, undef700, undef701, undef758, undef774, undef891, undef1041, undef1256, undef1541, undef1542, undef1622, undef1623, undef1703, undef1704, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l40, l40, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
<l40, l40, iq^0 <= n^0, {iq^0 -> 1 + iq^0, rest remain the same}>
Variables:
ip^0, iq^0, n^0

Graph 2:
Transitions:
<l36, l36, ip^0 <= n^0, {ip^0 -> 1 + ip^0, rest remain the same}>
Variables:
ip^0, n^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l40, ip^0 <= n^0, {all remain the same}>

Graph 2
<l0, l36, 1 + n^0 <= ip^0, {all remain the same}>
<l40, l36, n^0 <= ip^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>

Graph 3
<l36, l26, 1 + n^0 <= ip^0 /\ 51 <= i^0, {all remain the same}>
<l36, l26, 1 + n^0 <= ip^0 /\ i^0 <= 50, {sm^0 -> 0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 26 , 3 )
( 36 , 2 )
( 40 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.004082

Checking conditional termination of SCC {l40}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001999s
Ranking function: -iq^0 + n^0
New Graphs: 
Transitions:
<l40, l40, 1 + ip^0 <= n^0 /\ 1 + n^0 <= iq^0, {ip^0 -> 1 + ip^0, rest remain the same}>
Variables:
ip^0, iq^0, n^0
Checking conditional termination of SCC {l40}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001281s
Ranking function: -1 - ip^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.003031
Some transition disabled by a set of invariant(s):
Invariant at l36: 1 + n^0 <= ip^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l36, l36, ip^0 <= n^0, {ip^0 -> 1 + ip^0, rest remain the same}>
Checking unfeasibility...
Time used: 7.6e-05

Analyzing SCC {l36}...
No cycles found.

Proving termination of subgraph 3
Analyzing SCC {l26}...
No cycles found.

Program Terminates