Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
ITS pair #487098375
details
property
value
status
complete
benchmark
n-37.t2_fixed.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.03201 seconds
cpu usage
0.032779
user time
0.027253
system time
0.005526
max virtual memory
113188.0
max residence set size
7464.0
stage attributes
key
value
starexec-result
NO
output
NO Initial ITS Start location: l6 0: l0 -> l1 : Result_4^0'=Result_4^post0, selected_11^0'=selected_11^post0, ___cil_tmp6_12^0'=___cil_tmp6_12^post0, retryCount_10^0'=retryCount_10^post0, ___cil_tmp2_6^0'=___cil_tmp2_6^post0, x_5^0'=x_5^post0, maxRetries_9^0'=maxRetries_9^post0, (0 == 0 /\ -maxRetries_9^post0+maxRetries_9^0 == 0 /\ ___cil_tmp2_6^post0-x_5^0 == 0 /\ -retryCount_10^post0+retryCount_10^0 == 0 /\ -x_5^post0+x_5^0 == 0 /\ -Result_4^10+selected_11^post0 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post0 == 0 /\ Result_4^10-___cil_tmp2_6^post0 == 0), cost: 1 4: l1 -> l3 : Result_4^0'=Result_4^post4, selected_11^0'=selected_11^post4, ___cil_tmp6_12^0'=___cil_tmp6_12^post4, retryCount_10^0'=retryCount_10^post4, ___cil_tmp2_6^0'=___cil_tmp2_6^post4, x_5^0'=x_5^post4, maxRetries_9^0'=maxRetries_9^post4, (selected_11^0-selected_11^post4 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ -1+retryCount_10^post4-retryCount_10^0 == 0 /\ x_5^0-x_5^post4 == 0 /\ -___cil_tmp6_12^post4+___cil_tmp6_12^0 == 0 /\ -maxRetries_9^post4+maxRetries_9^0 == 0 /\ ___cil_tmp2_6^0-___cil_tmp2_6^post4 == 0), cost: 1 1: l2 -> l1 : Result_4^0'=Result_4^post1, selected_11^0'=selected_11^post1, ___cil_tmp6_12^0'=___cil_tmp6_12^post1, retryCount_10^0'=retryCount_10^post1, ___cil_tmp2_6^0'=___cil_tmp2_6^post1, x_5^0'=x_5^post1, maxRetries_9^0'=maxRetries_9^post1, (0 == 0 /\ ___cil_tmp2_6^post1-x_5^0 == 0 /\ -maxRetries_9^post1+maxRetries_9^0 == 0 /\ -___cil_tmp6_12^post1+___cil_tmp6_12^0 == 0 /\ -___cil_tmp2_6^post1+Result_4^11 == 0 /\ -Result_4^11+selected_11^post1 == 0 /\ retryCount_10^0-retryCount_10^post1 == 0 /\ x_5^0-x_5^post1 == 0), cost: 1 2: l3 -> l4 : Result_4^0'=Result_4^post2, selected_11^0'=selected_11^post2, ___cil_tmp6_12^0'=___cil_tmp6_12^post2, retryCount_10^0'=retryCount_10^post2, ___cil_tmp2_6^0'=___cil_tmp2_6^post2, x_5^0'=x_5^post2, maxRetries_9^0'=maxRetries_9^post2, (-x_5^post2+x_5^0 == 0 /\ -maxRetries_9^post2+maxRetries_9^0 == 0 /\ selected_11^0-selected_11^post2 == 0 /\ Result_4^post2-___cil_tmp6_12^post2 == 0 /\ -selected_11^0+___cil_tmp6_12^post2 == 0 /\ -___cil_tmp2_6^post2+___cil_tmp2_6^0 == 0 /\ retryCount_10^0-retryCount_10^post2 == 0), cost: 1 3: l3 -> l1 : Result_4^0'=Result_4^post3, selected_11^0'=selected_11^post3, ___cil_tmp6_12^0'=___cil_tmp6_12^post3, retryCount_10^0'=retryCount_10^post3, ___cil_tmp2_6^0'=___cil_tmp2_6^post3, x_5^0'=x_5^post3, maxRetries_9^0'=maxRetries_9^post3, (0 == 0 /\ -Result_4^12+selected_11^post3 == 0 /\ maxRetries_9^0-maxRetries_9^post3 == 0 /\ -retryCount_10^post3+retryCount_10^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post3 == 0 /\ Result_4^12-___cil_tmp2_6^post3 == 0 /\ -x_5^0+___cil_tmp2_6^post3 == 0), cost: 1 5: l5 -> l3 : Result_4^0'=Result_4^post5, selected_11^0'=selected_11^post5, ___cil_tmp6_12^0'=___cil_tmp6_12^post5, retryCount_10^0'=retryCount_10^post5, ___cil_tmp2_6^0'=___cil_tmp2_6^post5, x_5^0'=x_5^post5, maxRetries_9^0'=maxRetries_9^post5, (___cil_tmp2_6^0-___cil_tmp2_6^post5 == 0 /\ -4+maxRetries_9^post5 == 0 /\ retryCount_10^post5 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post5 == 0 /\ Result_4^0-Result_4^post5 == 0 /\ -x_5^post5+x_5^0 == 0 /\ selected_11^post5 == 0), cost: 1 6: l6 -> l5 : Result_4^0'=Result_4^post6, selected_11^0'=selected_11^post6, ___cil_tmp6_12^0'=___cil_tmp6_12^post6, retryCount_10^0'=retryCount_10^post6, ___cil_tmp2_6^0'=___cil_tmp2_6^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, (Result_4^0-Result_4^post6 == 0 /\ retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ -___cil_tmp2_6^post6+___cil_tmp2_6^0 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post6 == 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l6 4: l1 -> l3 : Result_4^0'=Result_4^post4, selected_11^0'=selected_11^post4, ___cil_tmp6_12^0'=___cil_tmp6_12^post4, retryCount_10^0'=retryCount_10^post4, ___cil_tmp2_6^0'=___cil_tmp2_6^post4, x_5^0'=x_5^post4, maxRetries_9^0'=maxRetries_9^post4, (selected_11^0-selected_11^post4 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ -1+retryCount_10^post4-retryCount_10^0 == 0 /\ x_5^0-x_5^post4 == 0 /\ -___cil_tmp6_12^post4+___cil_tmp6_12^0 == 0 /\ -maxRetries_9^post4+maxRetries_9^0 == 0 /\ ___cil_tmp2_6^0-___cil_tmp2_6^post4 == 0), cost: 1 3: l3 -> l1 : Result_4^0'=Result_4^post3, selected_11^0'=selected_11^post3, ___cil_tmp6_12^0'=___cil_tmp6_12^post3, retryCount_10^0'=retryCount_10^post3, ___cil_tmp2_6^0'=___cil_tmp2_6^post3, x_5^0'=x_5^post3, maxRetries_9^0'=maxRetries_9^post3, (0 == 0 /\ -Result_4^12+selected_11^post3 == 0 /\ maxRetries_9^0-maxRetries_9^post3 == 0 /\ -retryCount_10^post3+retryCount_10^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post3 == 0 /\ Result_4^12-___cil_tmp2_6^post3 == 0 /\ -x_5^0+___cil_tmp2_6^post3 == 0), cost: 1 5: l5 -> l3 : Result_4^0'=Result_4^post5, selected_11^0'=selected_11^post5, ___cil_tmp6_12^0'=___cil_tmp6_12^post5, retryCount_10^0'=retryCount_10^post5, ___cil_tmp2_6^0'=___cil_tmp2_6^post5, x_5^0'=x_5^post5, maxRetries_9^0'=maxRetries_9^post5, (___cil_tmp2_6^0-___cil_tmp2_6^post5 == 0 /\ -4+maxRetries_9^post5 == 0 /\ retryCount_10^post5 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post5 == 0 /\ Result_4^0-Result_4^post5 == 0 /\ -x_5^post5+x_5^0 == 0 /\ selected_11^post5 == 0), cost: 1 6: l6 -> l5 : Result_4^0'=Result_4^post6, selected_11^0'=selected_11^post6, ___cil_tmp6_12^0'=___cil_tmp6_12^post6, retryCount_10^0'=retryCount_10^post6, ___cil_tmp2_6^0'=___cil_tmp2_6^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, (Result_4^0-Result_4^post6 == 0 /\ retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ -___cil_tmp2_6^post6+___cil_tmp2_6^0 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post6 == 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0), cost: 1 Applied preprocessing Original rule: l3 -> l1 : Result_4^0'=Result_4^post3, selected_11^0'=selected_11^post3, ___cil_tmp6_12^0'=___cil_tmp6_12^post3, retryCount_10^0'=retryCount_10^post3, ___cil_tmp2_6^0'=___cil_tmp2_6^post3, x_5^0'=x_5^post3, maxRetries_9^0'=maxRetries_9^post3, (0 == 0 /\ -Result_4^12+selected_11^post3 == 0 /\ maxRetries_9^0-maxRetries_9^post3 == 0 /\ -retryCount_10^post3+retryCount_10^0 == 0 /\ -x_5^post3+x_5^0 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post3 == 0 /\ Result_4^12-___cil_tmp2_6^post3 == 0 /\ -x_5^0+___cil_tmp2_6^post3 == 0), cost: 1 New rule: l3 -> l1 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 1 Applied preprocessing Original rule: l1 -> l3 : Result_4^0'=Result_4^post4, selected_11^0'=selected_11^post4, ___cil_tmp6_12^0'=___cil_tmp6_12^post4, retryCount_10^0'=retryCount_10^post4, ___cil_tmp2_6^0'=___cil_tmp2_6^post4, x_5^0'=x_5^post4, maxRetries_9^0'=maxRetries_9^post4, (selected_11^0-selected_11^post4 == 0 /\ Result_4^0-Result_4^post4 == 0 /\ -1+retryCount_10^post4-retryCount_10^0 == 0 /\ x_5^0-x_5^post4 == 0 /\ -___cil_tmp6_12^post4+___cil_tmp6_12^0 == 0 /\ -maxRetries_9^post4+maxRetries_9^0 == 0 /\ ___cil_tmp2_6^0-___cil_tmp2_6^post4 == 0), cost: 1 New rule: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l3 : Result_4^0'=Result_4^post5, selected_11^0'=selected_11^post5, ___cil_tmp6_12^0'=___cil_tmp6_12^post5, retryCount_10^0'=retryCount_10^post5, ___cil_tmp2_6^0'=___cil_tmp2_6^post5, x_5^0'=x_5^post5, maxRetries_9^0'=maxRetries_9^post5, (___cil_tmp2_6^0-___cil_tmp2_6^post5 == 0 /\ -4+maxRetries_9^post5 == 0 /\ retryCount_10^post5 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post5 == 0 /\ Result_4^0-Result_4^post5 == 0 /\ -x_5^post5+x_5^0 == 0 /\ selected_11^post5 == 0), cost: 1 New rule: l5 -> l3 : selected_11^0'=0, retryCount_10^0'=0, maxRetries_9^0'=4, TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l5 : Result_4^0'=Result_4^post6, selected_11^0'=selected_11^post6, ___cil_tmp6_12^0'=___cil_tmp6_12^post6, retryCount_10^0'=retryCount_10^post6, ___cil_tmp2_6^0'=___cil_tmp2_6^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, (Result_4^0-Result_4^post6 == 0 /\ retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ -___cil_tmp2_6^post6+___cil_tmp2_6^0 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ ___cil_tmp6_12^0-___cil_tmp6_12^post6 == 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0), cost: 1 New rule: l6 -> l5 : TRUE, cost: 1 Simplified rules Start location: l6 8: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1 7: l3 -> l1 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 1 9: l5 -> l3 : selected_11^0'=0, retryCount_10^0'=0, maxRetries_9^0'=4, TRUE, cost: 1 10: l6 -> l5 : TRUE, cost: 1 Eliminating location l5 by chaining: Applied chaining First rule: l6 -> l5 : TRUE, cost: 1 Second rule: l5 -> l3 : selected_11^0'=0, retryCount_10^0'=0, maxRetries_9^0'=4, TRUE, cost: 1 New rule: l6 -> l3 : selected_11^0'=0, retryCount_10^0'=0, maxRetries_9^0'=4, TRUE, cost: 2 Applied deletion Removed the following rules: 9 10 Eliminating location l1 by chaining: Applied chaining First rule: l3 -> l1 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 1 Second rule: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1 New rule: l3 -> l3 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, retryCount_10^0'=1+retryCount_10^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: l6 12: l3 -> l3 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, retryCount_10^0'=1+retryCount_10^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 2 11: l6 -> l3 : selected_11^0'=0, retryCount_10^0'=0, maxRetries_9^0'=4, TRUE, cost: 2 Applied nonterm Original rule: l3 -> l3 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, retryCount_10^0'=1+retryCount_10^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 2 New rule: l3 -> [7] : 0 >= 0, cost: NONTERM Applied acceleration Original rule: l3 -> l3 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, retryCount_10^0'=1+retryCount_10^0, ___cil_tmp2_6^0'=x_5^0, 0 == 0, cost: 2 New rule: l3 -> l3 : Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, retryCount_10^0'=retryCount_10^0+n0, ___cil_tmp2_6^0'=x_5^0, 0 >= 0, cost: 2*n0 Applied deletion Removed the following rules: 12
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to ITS