Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729100332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ASLink-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729100332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 436K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748577271046

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 03:54:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 03:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:54:32] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-05-30 03:54:32] [INFO ] Transformed 1016 places.
[2025-05-30 03:54:32] [INFO ] Transformed 1554 transitions.
[2025-05-30 03:54:32] [INFO ] Found NUPN structural information;
[2025-05-30 03:54:32] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 984 transition count 1507
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 983 transition count 1507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 983 transition count 1505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 982 transition count 1497
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 982 transition count 1497
Applied a total of 45 rules in 216 ms. Remains 982 /1016 variables (removed 34) and now considering 1497/1538 (removed 41) transitions.
// Phase 1: matrix 1497 rows 982 cols
[2025-05-30 03:54:33] [INFO ] Computed 169 invariants in 83 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:54:33] [INFO ] Implicit Places using invariants in 965 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 220, 221, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 616, 634, 763, 768, 780, 785, 786, 820, 822, 843, 844, 845, 846, 863, 871, 879, 885, 891, 897, 903, 911, 917, 923, 931]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 997 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 935/1016 places, 1497/1538 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 923 transition count 1485
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 923 transition count 1485
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 915 transition count 1477
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 915 transition count 1477
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 911 transition count 1473
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 911 transition count 1473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 909 transition count 1471
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 909 transition count 1471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 908 transition count 1470
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 908 transition count 1470
Applied a total of 54 rules in 137 ms. Remains 908 /935 variables (removed 27) and now considering 1470/1497 (removed 27) transitions.
// Phase 1: matrix 1470 rows 908 cols
[2025-05-30 03:54:34] [INFO ] Computed 122 invariants in 44 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:54:34] [INFO ] Implicit Places using invariants in 524 ms returned []
[2025-05-30 03:54:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:54:36] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 908/1016 places, 1470/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3921 ms. Remains : 908/1016 places, 1470/1538 transitions.
Support contains 70 out of 908 places after structural reductions.
[2025-05-30 03:54:36] [INFO ] Flatten gal took : 139 ms
[2025-05-30 03:54:37] [INFO ] Flatten gal took : 79 ms
[2025-05-30 03:54:37] [INFO ] Input system was already deterministic with 1470 transitions.
Support contains 69 out of 908 places (down from 70) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 40 to 39
RANDOM walk for 40000 steps (270 resets) in 1712 ms. (23 steps per ms) remains 28/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
[2025-05-30 03:54:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 274/330 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 137/467 variables, 15/30 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 417/884 variables, 84/114 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:54:39] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:54:39] [INFO ] Deduced a trap composed of 26 places in 368 ms of which 52 ms to minimize.
Problem AtomicPropp17 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 2/116 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 24/908 variables, 8/124 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/908 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1470/2378 variables, 908/1032 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 (/ 3.0 4.0))
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 (/ 1.0 4.0))
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.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 0.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 0.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 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.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 1.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 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.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 1.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 0.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 0.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 0.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 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 1.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 1.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 1.0)
(s632 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2378/2378 variables, and 1032 constraints, problems are : Problem set: 2 solved, 26 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 93/93 constraints, State Equation: 908/908 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 269/319 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/319 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 146/465 variables, 16/29 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 419/884 variables, 85/114 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/884 variables, 2/116 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/884 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 24/908 variables, 8/124 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/908 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 10 (OVERLAPS) 1470/2378 variables, 908/1032 constraints. Problems are: Problem set: 10 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2378/2378 variables, and 1050 constraints, problems are : Problem set: 10 solved, 18 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 93/93 constraints, State Equation: 908/908 constraints, PredecessorRefiner: 18/28 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10132ms problems are : Problem set: 10 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 908/908 places, 1470/1470 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 908 transition count 1336
Reduce places removed 134 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 141 rules applied. Total rules applied 275 place count 774 transition count 1329
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 282 place count 767 transition count 1329
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 282 place count 767 transition count 1218
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 34 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 538 place count 622 transition count 1218
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 546 place count 615 transition count 1217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 547 place count 614 transition count 1217
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 547 place count 614 transition count 1206
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 569 place count 603 transition count 1206
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 577 place count 595 transition count 1186
Iterating global reduction 5 with 8 rules applied. Total rules applied 585 place count 595 transition count 1186
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 586 place count 594 transition count 1186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 586 place count 594 transition count 1185
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 588 place count 593 transition count 1185
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 594 place count 587 transition count 1172
Iterating global reduction 6 with 6 rules applied. Total rules applied 600 place count 587 transition count 1172
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 603 place count 584 transition count 1169
Iterating global reduction 6 with 3 rules applied. Total rules applied 606 place count 584 transition count 1169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 609 place count 584 transition count 1166
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 103 rules applied. Total rules applied 712 place count 532 transition count 1115
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 714 place count 530 transition count 1113
Iterating global reduction 7 with 2 rules applied. Total rules applied 716 place count 530 transition count 1113
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 717 place count 530 transition count 1112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 718 place count 529 transition count 1112
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 723 place count 529 transition count 1107
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 728 place count 524 transition count 1107
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 10 with 17 rules applied. Total rules applied 745 place count 524 transition count 1090
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 762 place count 507 transition count 1090
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 763 place count 507 transition count 1089
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 772 place count 507 transition count 1089
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 776 place count 507 transition count 1089
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 777 place count 507 transition count 1088
Applied a total of 777 rules in 540 ms. Remains 507 /908 variables (removed 401) and now considering 1088/1470 (removed 382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 507/908 places, 1088/1470 transitions.
RANDOM walk for 40000 steps (515 resets) in 999 ms. (40 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (11 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 330311 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :1 out of 18
Probabilistic random walk after 330311 steps, saw 84754 distinct states, run finished after 3006 ms. (steps per millisecond=109 ) properties seen :1
// Phase 1: matrix 1088 rows 507 cols
[2025-05-30 03:54:52] [INFO ] Computed 79 invariants in 15 ms
[2025-05-30 03:54:52] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 72/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 79/183 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 279/462 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:54:52] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 45/507 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 1088/1595 variables, 507/587 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1595 variables, 16/603 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1595 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 0/1595 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1595/1595 variables, and 603 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2547 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 507/507 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 72/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 79/183 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 279/462 variables, 51/71 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 45/507 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 10 (OVERLAPS) 1088/1595 variables, 507/587 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1595 variables, 16/603 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1595 variables, 4/607 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1595 variables, 0/607 constraints. Problems are: Problem set: 13 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1595 variables, 0/607 constraints. Problems are: Problem set: 13 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1595/1595 variables, and 607 constraints, problems are : Problem set: 13 solved, 4 unsolved in 3796 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 507/507 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6392ms problems are : Problem set: 13 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 5179 ms.
Support contains 8 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1088/1088 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 507 transition count 1086
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 505 transition count 1086
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 505 transition count 1085
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 503 transition count 1085
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 503 transition count 1084
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 502 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 501 transition count 1076
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 501 transition count 1076
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 500 transition count 1068
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 500 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 499 transition count 1060
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 499 transition count 1060
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 498 transition count 1052
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 498 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 497 transition count 1044
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 497 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 496 transition count 1036
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 496 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 495 transition count 1028
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 495 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 494 transition count 1020
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 494 transition count 1020
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 493 transition count 1012
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 493 transition count 1012
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 492 transition count 1004
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 492 transition count 1004
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 491 transition count 996
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 491 transition count 996
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 490 transition count 988
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 490 transition count 988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 489 transition count 980
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 489 transition count 980
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 45 place count 484 transition count 975
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 483 transition count 974
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 483 transition count 974
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 483 transition count 973
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 483 transition count 972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 482 transition count 972
Applied a total of 50 rules in 591 ms. Remains 482 /507 variables (removed 25) and now considering 972/1088 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 482/507 places, 972/1088 transitions.
RANDOM walk for 40000 steps (573 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (145 resets) in 136 ms. (292 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (130 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (114 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (151 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 309402 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 4
Probabilistic random walk after 309402 steps, saw 142009 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 972 rows 482 cols
[2025-05-30 03:55:07] [INFO ] Computed 78 invariants in 16 ms
[2025-05-30 03:55:07] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 157/213 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 244/457 variables, 49/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 25/482 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 972/1454 variables, 482/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1454 variables, 20/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1454 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1454 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1454/1454 variables, and 580 constraints, problems are : Problem set: 0 solved, 4 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 482/482 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 48/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 157/213 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 244/457 variables, 49/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/482 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 972/1454 variables, 482/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1454 variables, 20/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1454 variables, 4/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1454 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1454 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1454/1454 variables, and 585 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 482/482 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1953ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2730 ms.
Support contains 8 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 972/972 transitions.
Applied a total of 0 rules in 17 ms. Remains 482 /482 variables (removed 0) and now considering 972/972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 482/482 places, 972/972 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 972/972 transitions.
Applied a total of 0 rules in 16 ms. Remains 482 /482 variables (removed 0) and now considering 972/972 (removed 0) transitions.
[2025-05-30 03:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:12] [INFO ] Implicit Places using invariants in 484 ms returned [117, 124, 125, 126, 201, 209, 215, 218, 225, 226, 227, 296, 302, 305, 307, 310, 317, 318, 319, 320, 395, 401, 404, 406, 409, 422, 423, 478]
[2025-05-30 03:55:12] [INFO ] Actually due to overlaps returned [124, 225, 317, 125, 226, 318, 320, 423, 422, 126, 227, 319, 296, 302, 307, 395, 401, 406, 117, 201, 209, 215, 218, 310, 478]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 486 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 457/482 places, 972/972 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 457 transition count 964
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 449 transition count 964
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 449 transition count 956
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 33 place count 440 transition count 956
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 47 place count 426 transition count 942
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 426 transition count 942
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 426 transition count 938
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 69 place count 422 transition count 934
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 422 transition count 934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 421 transition count 933
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 421 transition count 933
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 87 place count 415 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 415 transition count 926
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 97 place count 415 transition count 917
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 106 place count 406 transition count 917
Applied a total of 106 rules in 74 ms. Remains 406 /457 variables (removed 51) and now considering 917/972 (removed 55) transitions.
// Phase 1: matrix 917 rows 406 cols
[2025-05-30 03:55:12] [INFO ] Computed 52 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:13] [INFO ] Implicit Places using invariants in 365 ms returned [72, 115, 173, 197, 253, 270, 326, 343]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 368 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 398/482 places, 917/972 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 916
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 393 transition count 912
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 393 transition count 908
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 389 transition count 908
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 389 transition count 908
Applied a total of 19 rules in 53 ms. Remains 389 /398 variables (removed 9) and now considering 908/917 (removed 9) transitions.
// Phase 1: matrix 908 rows 389 cols
[2025-05-30 03:55:13] [INFO ] Computed 44 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:13] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-30 03:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 03:55:14] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 389/482 places, 908/972 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2017 ms. Remains : 389/482 places, 908/972 transitions.
RANDOM walk for 40000 steps (745 resets) in 180 ms. (220 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (204 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (152 resets) in 62 ms. (634 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2025-05-30 03:55:14] [INFO ] Invariant cache hit.
[2025-05-30 03:55:14] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/164 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 223/387 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/389 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 908/1297 variables, 389/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1297 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1297 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1297 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 437 constraints, problems are : Problem set: 0 solved, 3 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 389/389 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/164 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 223/387 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/389 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 908/1297 variables, 389/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1297 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1297 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:16] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1297 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1297 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1297 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 389/389 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2015ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 794 ms.
Support contains 6 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 908/908 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 388 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 388 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 387 transition count 906
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 387 transition count 906
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 386 transition count 905
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 386 transition count 905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 385 transition count 904
Applied a total of 7 rules in 43 ms. Remains 385 /389 variables (removed 4) and now considering 904/908 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 385/389 places, 904/908 transitions.
RANDOM walk for 40000 steps (755 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (208 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (157 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (162 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 454717 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :2 out of 3
Probabilistic random walk after 454717 steps, saw 185833 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :2
// Phase 1: matrix 904 rows 385 cols
[2025-05-30 03:55:20] [INFO ] Computed 44 invariants in 15 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/80 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/198 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/203 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/302 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/350 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 35/385 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 904/1289 variables, 385/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1289 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1289 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1289/1289 variables, and 429 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/80 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 118/198 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/203 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 99/302 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 48/350 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 35/385 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 904/1289 variables, 385/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1289 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:21] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 16 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1289 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1289 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1289 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1289/1289 variables, and 431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1047ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 259 ms.
Support contains 2 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 904/904 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 385 transition count 901
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 380 transition count 901
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 376 transition count 897
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 376 transition count 893
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 372 transition count 893
Applied a total of 24 rules in 45 ms. Remains 372 /385 variables (removed 13) and now considering 893/904 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 372/385 places, 893/904 transitions.
RANDOM walk for 40000 steps (752 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (225 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 660532 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 660532 steps, saw 265943 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
// Phase 1: matrix 893 rows 372 cols
[2025-05-30 03:55:24] [INFO ] Computed 42 invariants in 10 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/43 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 110/153 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/184 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/197 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/230 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 108/338 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/356 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:25] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/372 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/372 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 893/1265 variables, 372/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1265 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1265 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1265/1265 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/43 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 110/153 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/184 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/197 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 33/230 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 108/338 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/356 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/372 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/372 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 893/1265 variables, 372/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1265 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1265 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1265 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1265/1265 variables, and 416 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 802ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 2 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 893/893 transitions.
Applied a total of 0 rules in 13 ms. Remains 372 /372 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 372/372 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 893/893 transitions.
Applied a total of 0 rules in 10 ms. Remains 372 /372 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2025-05-30 03:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:25] [INFO ] Implicit Places using invariants in 242 ms returned [77, 86, 92, 97, 101, 119]
[2025-05-30 03:55:25] [INFO ] Actually due to overlaps returned [101, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 243 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 370/372 places, 893/893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 370 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 369 transition count 892
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 366 transition count 889
Applied a total of 8 rules in 19 ms. Remains 366 /370 variables (removed 4) and now considering 889/893 (removed 4) transitions.
// Phase 1: matrix 889 rows 366 cols
[2025-05-30 03:55:26] [INFO ] Computed 40 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:26] [INFO ] Implicit Places using invariants in 241 ms returned [86, 92, 97]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 242 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 363/372 places, 889/893 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 361 transition count 887
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 361 transition count 887
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 360 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 360 transition count 886
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 359 transition count 885
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 359 transition count 882
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 356 transition count 882
Applied a total of 14 rules in 40 ms. Remains 356 /363 variables (removed 7) and now considering 882/889 (removed 7) transitions.
// Phase 1: matrix 882 rows 356 cols
[2025-05-30 03:55:26] [INFO ] Computed 37 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:26] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-30 03:55:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:27] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 356/372 places, 882/893 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1541 ms. Remains : 356/372 places, 882/893 transitions.
RANDOM walk for 40000 steps (724 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (228 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 634799 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 634799 steps, saw 247803 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2025-05-30 03:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/124 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/127 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/140 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/173 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 149/322 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/340 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 882/1238 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1238 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1238 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1238/1238 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/124 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/127 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/140 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/173 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 149/322 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/340 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 882/1238 variables, 356/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1238 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1238 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1238 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1238/1238 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 734ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 2 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 356/356 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 882/882 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2025-05-30 03:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:31] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-05-30 03:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:55:32] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:55:32] [INFO ] Redundant transitions in 47 ms returned []
Running 860 sub problems to find dead transitions.
[2025-05-30 03:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:59] [INFO ] Deduced a trap composed of 88 places in 206 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:55:59] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:56:00] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:56:02] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 33 ms to minimize.
SMT process timed out in 30386ms, After SMT, problems are : Problem set: 0 solved, 860 unsolved
Search for dead transitions found 0 dead transitions in 30391ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31483 ms. Remains : 356/356 places, 882/882 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 03:56:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 03:56:02] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-05-30 03:56:02] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 11 ms returned sat
[2025-05-30 03:56:02] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 03:56:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-30 03:56:03] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 9 ms returned sat
[2025-05-30 03:56:03] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 03:56:03] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 03:56:03] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 688 ms.
FORMULA ASLink-PT-04a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 24 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-04a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-04a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X(p1))))))'
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1470/1470 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 904 transition count 1454
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 904 transition count 1454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 901 transition count 1444
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 901 transition count 1444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 899 transition count 1435
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 899 transition count 1435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 897 transition count 1426
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 897 transition count 1426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 895 transition count 1417
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 895 transition count 1417
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 893 transition count 1408
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 893 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 892 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 892 transition count 1400
Applied a total of 32 rules in 156 ms. Remains 892 /908 variables (removed 16) and now considering 1400/1470 (removed 70) transitions.
// Phase 1: matrix 1400 rows 892 cols
[2025-05-30 03:56:03] [INFO ] Computed 122 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:04] [INFO ] Implicit Places using invariants in 504 ms returned [210, 228, 574, 756, 785]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 505 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 887/908 places, 1400/1470 transitions.
Applied a total of 0 rules in 22 ms. Remains 887 /887 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 683 ms. Remains : 887/908 places, 1400/1470 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-00 finished in 1050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1470/1470 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 904 transition count 1454
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 904 transition count 1454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 901 transition count 1444
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 901 transition count 1444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 899 transition count 1435
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 899 transition count 1435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 897 transition count 1426
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 897 transition count 1426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 895 transition count 1417
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 895 transition count 1417
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 893 transition count 1408
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 893 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 892 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 892 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 891 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 891 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 890 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 890 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 889 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 889 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 888 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 888 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 887 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 887 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 886 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 886 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 885 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 885 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 884 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 884 transition count 1336
Applied a total of 48 rules in 327 ms. Remains 884 /908 variables (removed 24) and now considering 1336/1470 (removed 134) transitions.
// Phase 1: matrix 1336 rows 884 cols
[2025-05-30 03:56:04] [INFO ] Computed 122 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:05] [INFO ] Implicit Places using invariants in 540 ms returned [210, 228, 574, 756, 777]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 542 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/908 places, 1336/1470 transitions.
Applied a total of 0 rules in 22 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 891 ms. Remains : 879/908 places, 1336/1470 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 740 steps with 8 reset in 18 ms.
FORMULA ASLink-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-01 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X((p1||X(p1))))))))'
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1470/1470 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 904 transition count 1454
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 904 transition count 1454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 901 transition count 1444
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 901 transition count 1444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 899 transition count 1435
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 899 transition count 1435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 897 transition count 1426
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 897 transition count 1426
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 895 transition count 1417
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 895 transition count 1417
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 893 transition count 1408
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 893 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 892 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 892 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 891 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 891 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 890 transition count 1384
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 890 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 889 transition count 1376
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 889 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 888 transition count 1368
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 888 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 887 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 887 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 886 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 886 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 885 transition count 1344
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 885 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 884 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 884 transition count 1336
Applied a total of 48 rules in 353 ms. Remains 884 /908 variables (removed 24) and now considering 1336/1470 (removed 134) transitions.
[2025-05-30 03:56:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:06] [INFO ] Implicit Places using invariants in 498 ms returned [210, 228, 574, 777]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 500 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 880/908 places, 1336/1470 transitions.
Applied a total of 0 rules in 24 ms. Remains 880 /880 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 878 ms. Remains : 880/908 places, 1336/1470 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-03 finished in 1087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(false U !p0)) U p1))'
Support contains 4 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1470/1470 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 905 transition count 1455
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 905 transition count 1455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 903 transition count 1446
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 903 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 902 transition count 1438
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 902 transition count 1438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 901 transition count 1430
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 901 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 900 transition count 1422
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 900 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 899 transition count 1414
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 899 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 898 transition count 1406
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 898 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 897 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 897 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 896 transition count 1390
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 896 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 895 transition count 1382
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 895 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 894 transition count 1374
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 894 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 893 transition count 1366
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 893 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 892 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 892 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 891 transition count 1350
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 891 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 890 transition count 1342
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 890 transition count 1342
Applied a total of 36 rules in 337 ms. Remains 890 /908 variables (removed 18) and now considering 1342/1470 (removed 128) transitions.
// Phase 1: matrix 1342 rows 890 cols
[2025-05-30 03:56:07] [INFO ] Computed 122 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:07] [INFO ] Implicit Places using invariants in 517 ms returned [210, 228, 574, 756, 777]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 528 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 885/908 places, 1342/1470 transitions.
Applied a total of 0 rules in 19 ms. Remains 885 /885 variables (removed 0) and now considering 1342/1342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 885 ms. Remains : 885/908 places, 1342/1470 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-06 finished in 993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 908 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 908/908 places, 1470/1470 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 907 transition count 1318
Reduce places removed 155 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 158 rules applied. Total rules applied 309 place count 752 transition count 1315
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 312 place count 749 transition count 1315
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 312 place count 749 transition count 1194
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 279 rules applied. Total rules applied 591 place count 591 transition count 1194
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 21 rules applied. Total rules applied 612 place count 579 transition count 1185
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 621 place count 570 transition count 1185
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 621 place count 570 transition count 1172
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 647 place count 557 transition count 1172
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 658 place count 546 transition count 1149
Iterating global reduction 5 with 11 rules applied. Total rules applied 669 place count 546 transition count 1149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 5 rules applied. Total rules applied 674 place count 545 transition count 1145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 674 place count 545 transition count 1144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 676 place count 544 transition count 1144
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 681 place count 539 transition count 1132
Iterating global reduction 6 with 5 rules applied. Total rules applied 686 place count 539 transition count 1132
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 690 place count 535 transition count 1121
Iterating global reduction 6 with 4 rules applied. Total rules applied 694 place count 535 transition count 1121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 697 place count 535 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 698 place count 534 transition count 1110
Iterating global reduction 7 with 1 rules applied. Total rules applied 699 place count 534 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 700 place count 533 transition count 1102
Iterating global reduction 7 with 1 rules applied. Total rules applied 701 place count 533 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 702 place count 532 transition count 1094
Iterating global reduction 7 with 1 rules applied. Total rules applied 703 place count 532 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 704 place count 531 transition count 1086
Iterating global reduction 7 with 1 rules applied. Total rules applied 705 place count 531 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 706 place count 530 transition count 1078
Iterating global reduction 7 with 1 rules applied. Total rules applied 707 place count 530 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 708 place count 529 transition count 1070
Iterating global reduction 7 with 1 rules applied. Total rules applied 709 place count 529 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 710 place count 528 transition count 1062
Iterating global reduction 7 with 1 rules applied. Total rules applied 711 place count 528 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 712 place count 527 transition count 1054
Iterating global reduction 7 with 1 rules applied. Total rules applied 713 place count 527 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 714 place count 526 transition count 1046
Iterating global reduction 7 with 1 rules applied. Total rules applied 715 place count 526 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 716 place count 525 transition count 1038
Iterating global reduction 7 with 1 rules applied. Total rules applied 717 place count 525 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 718 place count 524 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 719 place count 524 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 720 place count 523 transition count 1022
Iterating global reduction 7 with 1 rules applied. Total rules applied 721 place count 523 transition count 1022
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 831 place count 468 transition count 967
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 834 place count 465 transition count 964
Iterating global reduction 7 with 3 rules applied. Total rules applied 837 place count 465 transition count 964
Applied a total of 837 rules in 260 ms. Remains 465 /908 variables (removed 443) and now considering 964/1470 (removed 506) transitions.
// Phase 1: matrix 964 rows 465 cols
[2025-05-30 03:56:07] [INFO ] Computed 68 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:08] [INFO ] Implicit Places using invariants in 374 ms returned [72, 112, 130, 165, 186, 194, 200, 202, 262, 279, 285, 290, 292, 301, 354, 375, 381, 386, 388, 400, 461]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 377 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 444/908 places, 964/1470 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 444 transition count 950
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 430 transition count 950
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 430 transition count 946
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 426 transition count 946
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 420 transition count 940
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 420 transition count 940
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 414 transition count 934
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 414 transition count 934
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 411 transition count 931
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 411 transition count 931
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 399 transition count 919
Applied a total of 90 rules in 48 ms. Remains 399 /444 variables (removed 45) and now considering 919/964 (removed 45) transitions.
// Phase 1: matrix 919 rows 399 cols
[2025-05-30 03:56:08] [INFO ] Computed 47 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:08] [INFO ] Implicit Places using invariants in 261 ms returned [87, 93, 98]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 264 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 396/908 places, 919/1470 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 394 transition count 917
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 394 transition count 917
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 392 transition count 915
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 392 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 391 transition count 914
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 391 transition count 914
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 390 transition count 913
Applied a total of 12 rules in 49 ms. Remains 390 /396 variables (removed 6) and now considering 913/919 (removed 6) transitions.
// Phase 1: matrix 913 rows 390 cols
[2025-05-30 03:56:08] [INFO ] Computed 44 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:08] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-05-30 03:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:56:09] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 390/908 places, 913/1470 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1907 ms. Remains : 390/908 places, 913/1470 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-11
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-11 finished in 1992 ms.
All properties solved by simple procedures.
Total runtime 97424 ms.

BK_STOP 1748577369749

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="ASLink-PT-04a"
export BK_EXAMINATION="LTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;