Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer Transition Systems pair #487526057
details
property
value
status
complete
benchmark
loop_on_input.t2.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
From_T2
run statistics
property
value
solver
LoAT
configuration
loat_nonterm_proofout
runtime (wallclock)
0.164803981781 seconds
cpu usage
0.088161837
max memory
1.2689408E7
stage attributes
key
value
output-size
6944
starexec-result
WORST_CASE(Omega(0),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(0),?) Initial ITS Start location: l5 0: l0 -> l1 : __const_5^0'=__const_5^post0, x^0'=x^post0, (__const_5^0-__const_5^post0 == 0 /\ x^0 <= 0 /\ -1+x^post0 == 0), cost: 1 1: l0 -> l1 : __const_5^0'=__const_5^post1, x^0'=x^post1, (1-x^0 <= 0 /\ -1+x^post1-x^0 == 0 /\ __const_5^0-__const_5^post1 == 0), cost: 1 4: l1 -> l2 : __const_5^0'=__const_5^post4, x^0'=x^post4, (__const_5^0-__const_5^post4 == 0 /\ -x^post4+x^0 == 0), cost: 1 2: l2 -> l3 : __const_5^0'=__const_5^post2, x^0'=x^post2, (-x^post2+x^0 == 0 /\ __const_5^0-__const_5^post2 == 0 /\ 4-x^0 <= 0), cost: 1 3: l2 -> l0 : __const_5^0'=__const_5^post3, x^0'=x^post3, (__const_5^0-__const_5^post3 == 0 /\ -3+x^0 <= 0 /\ x^0-x^post3 == 0), cost: 1 5: l4 -> l1 : __const_5^0'=__const_5^post5, x^0'=x^post5, (0 == 0 /\ -__const_5^0+x^10 == 0 /\ __const_5^0-__const_5^post5 == 0), cost: 1 6: l5 -> l4 : __const_5^0'=__const_5^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ __const_5^0-__const_5^post6 == 0), cost: 1 Removed unreachable rules and leafs Start location: l5 0: l0 -> l1 : __const_5^0'=__const_5^post0, x^0'=x^post0, (__const_5^0-__const_5^post0 == 0 /\ x^0 <= 0 /\ -1+x^post0 == 0), cost: 1 1: l0 -> l1 : __const_5^0'=__const_5^post1, x^0'=x^post1, (1-x^0 <= 0 /\ -1+x^post1-x^0 == 0 /\ __const_5^0-__const_5^post1 == 0), cost: 1 4: l1 -> l2 : __const_5^0'=__const_5^post4, x^0'=x^post4, (__const_5^0-__const_5^post4 == 0 /\ -x^post4+x^0 == 0), cost: 1 3: l2 -> l0 : __const_5^0'=__const_5^post3, x^0'=x^post3, (__const_5^0-__const_5^post3 == 0 /\ -3+x^0 <= 0 /\ x^0-x^post3 == 0), cost: 1 5: l4 -> l1 : __const_5^0'=__const_5^post5, x^0'=x^post5, (0 == 0 /\ -__const_5^0+x^10 == 0 /\ __const_5^0-__const_5^post5 == 0), cost: 1 6: l5 -> l4 : __const_5^0'=__const_5^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ __const_5^0-__const_5^post6 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : __const_5^0'=__const_5^post0, x^0'=x^post0, (__const_5^0-__const_5^post0 == 0 /\ x^0 <= 0 /\ -1+x^post0 == 0), cost: 1 New rule: l0 -> l1 : x^0'=1, x^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l1 : __const_5^0'=__const_5^post1, x^0'=x^post1, (1-x^0 <= 0 /\ -1+x^post1-x^0 == 0 /\ __const_5^0-__const_5^post1 == 0), cost: 1 New rule: l0 -> l1 : x^0'=1+x^0, -1+x^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : __const_5^0'=__const_5^post3, x^0'=x^post3, (__const_5^0-__const_5^post3 == 0 /\ -3+x^0 <= 0 /\ x^0-x^post3 == 0), cost: 1 New rule: l2 -> l0 : -3+x^0 <= 0, cost: 1 Applied preprocessing Original rule: l1 -> l2 : __const_5^0'=__const_5^post4, x^0'=x^post4, (__const_5^0-__const_5^post4 == 0 /\ -x^post4+x^0 == 0), cost: 1 New rule: l1 -> l2 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l1 : __const_5^0'=__const_5^post5, x^0'=x^post5, (0 == 0 /\ -__const_5^0+x^10 == 0 /\ __const_5^0-__const_5^post5 == 0), cost: 1 New rule: l4 -> l1 : x^0'=x^post5, 0 == 0, cost: 1 Applied preprocessing Original rule: l5 -> l4 : __const_5^0'=__const_5^post6, x^0'=x^post6, (-x^post6+x^0 == 0 /\ __const_5^0-__const_5^post6 == 0), cost: 1 New rule: l5 -> l4 : TRUE, cost: 1 Simplified rules Start location: l5 7: l0 -> l1 : x^0'=1, x^0 <= 0, cost: 1 8: l0 -> l1 : x^0'=1+x^0, -1+x^0 >= 0, cost: 1 10: l1 -> l2 : TRUE, cost: 1 9: l2 -> l0 : -3+x^0 <= 0, cost: 1 11: l4 -> l1 : x^0'=x^post5, 0 == 0, cost: 1 12: l5 -> l4 : TRUE, cost: 1 Eliminating location l4 by chaining: Applied chaining First rule: l5 -> l4 : TRUE, cost: 1 Second rule: l4 -> l1 : x^0'=x^post5, 0 == 0, cost: 1 New rule: l5 -> l1 : x^0'=x^post5, 0 == 0, cost: 2 Applied deletion Removed the following rules: 11 12 Eliminating location l2 by chaining: Applied chaining First rule: l1 -> l2 : TRUE, cost: 1 Second rule: l2 -> l0 : -3+x^0 <= 0, cost: 1 New rule: l1 -> l0 : -3+x^0 <= 0, cost: 2 Applied deletion Removed the following rules: 9 10
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer Transition Systems