Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r602-tall-171774424600205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BlocksWorld-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 253K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 378K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 23K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 149K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 627K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 689K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 817K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.5M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 35K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:26 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-00
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-01
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-02
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-03
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-04
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-05
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-06
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-07
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-08
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-09
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-10
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-11
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-12
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-13
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-14
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717756303250

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-07 10:31:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 10:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:31:44] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2024-06-07 10:31:44] [INFO ] Transformed 1189 places.
[2024-06-07 10:31:44] [INFO ] Transformed 2245 transitions.
[2024-06-07 10:31:44] [INFO ] Found NUPN structural information;
[2024-06-07 10:31:44] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32]
[2024-06-07 10:31:44] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 31 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[0, 4, 29, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 4, 29, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 10:31:45] [INFO ] Computed 67 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 4, 29, 0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[33, 33, 1089, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA BlocksWorld-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 495 ms. (20 steps per ms)
FORMULA BlocksWorld-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-06 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (6 resets) in 390 ms. (76 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 32] Max Struct:[33, 1089]
[2024-06-07 10:31:46] [INFO ] Invariant cache hit.
[2024-06-07 10:31:46] [INFO ] [Real]Absence check using 67 positive place invariants in 35 ms returned unsat
[2024-06-07 10:31:46] [INFO ] [Real]Absence check using 67 positive place invariants in 65 ms returned sat
[2024-06-07 10:31:47] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2024-06-07 10:31:47] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-07 10:31:47] [INFO ] [Real]Added 59 Read/Feed constraints in 190 ms returned sat
[2024-06-07 10:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 10:31:48] [INFO ] [Nat]Absence check using 67 positive place invariants in 48 ms returned sat
[2024-06-07 10:31:48] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2024-06-07 10:31:48] [INFO ] [Nat]Added 59 Read/Feed constraints in 217 ms returned sat
[2024-06-07 10:31:49] [INFO ] Deduced a trap composed of 377 places in 936 ms of which 71 ms to minimize.
[2024-06-07 10:31:50] [INFO ] Deduced a trap composed of 264 places in 854 ms of which 10 ms to minimize.
[2024-06-07 10:31:51] [INFO ] Deduced a trap composed of 294 places in 896 ms of which 10 ms to minimize.
[2024-06-07 10:31:52] [INFO ] Deduced a trap composed of 297 places in 912 ms of which 9 ms to minimize.
[2024-06-07 10:31:52] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 3931 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 32] Max Struct:[1, 1089]
FORMULA BlocksWorld-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[1089]
Support contains 1089 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2245/2245 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1189 transition count 2244
Applied a total of 1 rules in 443 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2245 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 1189/1189 places, 2244/2245 transitions.
// Phase 1: matrix 2244 rows 1189 cols
[2024-06-07 10:31:53] [INFO ] Computed 67 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[32] Max Struct:[1089]
RANDOM walk for 836085 steps (2 resets) in 30001 ms. (27 steps per ms)
BEST_FIRST walk for 231232 steps (0 resets) in 5001 ms. (46 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[32] Max Struct:[1089]
[2024-06-07 10:32:28] [INFO ] Invariant cache hit.
[2024-06-07 10:32:28] [INFO ] [Real]Absence check using 67 positive place invariants in 53 ms returned sat
[2024-06-07 10:32:29] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-06-07 10:32:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-07 10:32:29] [INFO ] [Real]Added 58 Read/Feed constraints in 130 ms returned sat
[2024-06-07 10:32:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 10:32:29] [INFO ] [Nat]Absence check using 67 positive place invariants in 54 ms returned sat
[2024-06-07 10:32:30] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2024-06-07 10:32:30] [INFO ] [Nat]Added 58 Read/Feed constraints in 255 ms returned sat
[2024-06-07 10:32:31] [INFO ] Deduced a trap composed of 34 places in 875 ms of which 8 ms to minimize.
[2024-06-07 10:32:32] [INFO ] Deduced a trap composed of 250 places in 858 ms of which 8 ms to minimize.
[2024-06-07 10:32:33] [INFO ] Deduced a trap composed of 374 places in 807 ms of which 8 ms to minimize.
[2024-06-07 10:32:35] [INFO ] Deduced a trap composed of 126 places in 884 ms of which 10 ms to minimize.
[2024-06-07 10:32:36] [INFO ] Deduced a trap composed of 388 places in 840 ms of which 8 ms to minimize.
[2024-06-07 10:32:37] [INFO ] Deduced a trap composed of 377 places in 856 ms of which 8 ms to minimize.
[2024-06-07 10:32:37] [INFO ] Deduced a trap composed of 344 places in 857 ms of which 9 ms to minimize.
[2024-06-07 10:32:39] [INFO ] Deduced a trap composed of 280 places in 919 ms of which 8 ms to minimize.
[2024-06-07 10:32:39] [INFO ] Deduced a trap composed of 377 places in 853 ms of which 8 ms to minimize.
[2024-06-07 10:32:41] [INFO ] Deduced a trap composed of 376 places in 808 ms of which 7 ms to minimize.
[2024-06-07 10:32:42] [INFO ] Deduced a trap composed of 294 places in 846 ms of which 8 ms to minimize.
[2024-06-07 10:32:47] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 16277 ms
Current structural bounds on expressions (after SMT) : Max Seen:[32] Max Struct:[1089]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[1089]
Support contains 1089 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2244/2244 transitions.
Applied a total of 0 rules in 244 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 1189/1189 places, 2244/2244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2244/2244 transitions.
Applied a total of 0 rules in 277 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
[2024-06-07 10:32:47] [INFO ] Invariant cache hit.
[2024-06-07 10:32:48] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-07 10:32:48] [INFO ] Invariant cache hit.
[2024-06-07 10:32:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-07 10:32:49] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2024-06-07 10:32:49] [INFO ] Redundant transitions in 186 ms returned []
Running 2240 sub problems to find dead transitions.
[2024-06-07 10:32:49] [INFO ] Invariant cache hit.
[2024-06-07 10:32:49] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2238 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(timeout
s365 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1185 variables, 60/60 constraints. Problems are: Problem set: 60 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/3433 variables, and 60 constraints, problems are : Problem set: 60 solved, 2180 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 2210/1122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 2180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 4/4 constraints. Problems are: Problem set: 60 solved, 2180 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 1)
(s56 1)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 1)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 1)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 1)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3433 variables, and 4 constraints, problems are : Problem set: 60 solved, 2180 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1088/1122 constraints, Known Traps: 0/0 constraints]
After SMT, in 76719ms problems are : Problem set: 60 solved, 2180 unsolved
Search for dead transitions found 60 dead transitions in 76768ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1189/1189 places, 2184/2244 transitions.
Deduced a syphon composed of 30 places in 1 ms
Applied a total of 0 rules in 208 ms. Remains 1189 /1189 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-07 10:34:06] [INFO ] Redundant transitions in 50 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79505 ms. Remains : 1189/1189 places, 2184/2244 transitions.
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
// Phase 1: matrix 2184 rows 1159 cols
[2024-06-07 10:34:06] [INFO ] Computed 67 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[32] Max Struct:[1059]
RANDOM walk for 781261 steps (2 resets) in 30001 ms. (26 steps per ms)
BEST_FIRST walk for 222107 steps (0 resets) in 5001 ms. (44 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[32] Max Struct:[1059]
[2024-06-07 10:34:41] [INFO ] Invariant cache hit.
[2024-06-07 10:34:42] [INFO ] [Real]Absence check using 67 positive place invariants in 56 ms returned sat
[2024-06-07 10:34:42] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2024-06-07 10:34:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-07 10:34:42] [INFO ] [Real]Added 6 Read/Feed constraints in 31 ms returned sat
[2024-06-07 10:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 10:34:43] [INFO ] [Nat]Absence check using 67 positive place invariants in 55 ms returned sat
[2024-06-07 10:34:43] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2024-06-07 10:34:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 34 ms returned sat
[2024-06-07 10:34:44] [INFO ] Deduced a trap composed of 124 places in 758 ms of which 8 ms to minimize.
[2024-06-07 10:34:45] [INFO ] Deduced a trap composed of 66 places in 758 ms of which 7 ms to minimize.
[2024-06-07 10:34:46] [INFO ] Deduced a trap composed of 66 places in 763 ms of which 9 ms to minimize.
[2024-06-07 10:34:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 2459 ms
Current structural bounds on expressions (after SMT) : Max Seen:[32] Max Struct:[32]
FORMULA BlocksWorld-PT-06-UpperBounds-04 32 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-02 32 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-07 10:34:46] [INFO ] Flatten gal took : 237 ms
[2024-06-07 10:34:46] [INFO ] Flatten gal took : 130 ms
[2024-06-07 10:34:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2638335539913079152.gal : 46 ms
[2024-06-07 10:34:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10029280249463984731.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2638335539913079152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10029280249463984731.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 182476 ms.

BK_STOP 1717756487029

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-06.tgz
mv BlocksWorld-PT-06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;