Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r105-smll-174867012900418.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 HealthRecord-PT-17, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-smll-174867012900418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 175K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748740173230

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-01 01:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-01 01:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:09:36] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2025-06-01 01:09:36] [INFO ] Transformed 624 places.
[2025-06-01 01:09:36] [INFO ] Transformed 828 transitions.
[2025-06-01 01:09:36] [INFO ] Found NUPN structural information;
[2025-06-01 01:09:36] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 614 ms.
Graph (trivial) has 749 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 11 ms
Free SCC test removed 66 places
Structural test allowed to assert that 266 places are NOT stable. Took 55 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
[2025-06-01 01:09:37] [INFO ] Flatten gal took : 343 ms
[2025-06-01 01:09:38] [INFO ] Flatten gal took : 62 ms
RANDOM walk for 40000 steps (363 resets) in 4442 ms. (9 steps per ms) remains 306/358 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 steps per ms) remains 306/306 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 38 ms. (10 steps per ms) remains 306/306 properties
BEST_FIRST walk for 401 steps (8 resets) in 33 ms. (11 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 34 ms. (11 steps per ms) remains 306/306 properties
[2025-06-01 01:09:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4238345693624163058.gal : 72 ms
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 306/306 properties
[2025-06-01 01:09:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5746903568167456110.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4238345693624163058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5746903568167456110.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 403 steps (8 resets) in 26 ms. (14 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 306/306 properties

its-reach command run as :
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 306/306 properties

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 306/306 properties
Loading property file /tmp/ReachabilityCardinality5746903568167456110.prop.
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 306/306 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 306/306 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 306/306 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 306/306 properties
[2025-06-01 01:09:38] [INFO ] Flow matrix only has 733 transitions (discarded 20 similar events)
// Phase 1: matrix 733 rows 558 cols
[2025-06-01 01:09:38] [INFO ] Computed 18 invariants in 39 ms
[2025-06-01 01:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,306 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,306 properties remain. new max is 8
SDD size :5 after 11
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,306 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,306 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,306 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,306 properties remain. new max is 128
SDD size :27 after 41
SDD proceeding with computation,306 properties remain. new max is 256
SDD size :41 after 461
SDD proceeding with computation,306 properties remain. new max is 512
SDD size :461 after 2.79368e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/1291 variables, and 306 constraints, problems are : Problem set: 0 solved, 306 unsolved in 5101 ms.
Refiners :[Domain max(s): 306/558 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/558 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 306/306 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (OVERLAPS) 51/357 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 51/367 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:48] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:48] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:48] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:09:48] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 5 ms to minimize.
SMT process timed out in 10471ms, After SMT, problems are : Problem set: 0 solved, 306 unsolved
Fused 306 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 306 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 753/753 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 558 transition count 590
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
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 1 with 159 rules applied. Total rules applied 322 place count 416 transition count 573
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 331 place count 407 transition count 573
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 331 place count 407 transition count 563
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 351 place count 397 transition count 563
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 352 place count 396 transition count 561
Iterating global reduction 3 with 1 rules applied. Total rules applied 353 place count 396 transition count 561
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 389 place count 378 transition count 543
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 405 place count 370 transition count 589
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 411 place count 370 transition count 583
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 431 place count 370 transition count 563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 433 place count 369 transition count 573
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 458 place count 369 transition count 548
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 483 place count 344 transition count 548
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 489 place count 344 transition count 548
Applied a total of 489 rules in 249 ms. Remains 344 /558 variables (removed 214) and now considering 548/753 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 344/558 places, 548/753 transitions.
RANDOM walk for 4000000 steps (446513 resets) in 69143 ms. (57 steps per ms) remains 138/306 properties
BEST_FIRST walk for 40003 steps (528 resets) in 119 ms. (333 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (511 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (520 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (519 resets) in 138 ms. (287 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (532 resets) in 115 ms. (344 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (521 resets) in 126 ms. (314 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (534 resets) in 116 ms. (341 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (534 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (524 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (519 resets) in 88 ms. (449 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (516 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (510 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (511 resets) in 93 ms. (425 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (517 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (535 resets) in 92 ms. (430 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (524 resets) in 122 ms. (325 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (534 resets) in 162 ms. (245 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (543 resets) in 163 ms. (243 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (533 resets) in 157 ms. (253 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (523 resets) in 177 ms. (224 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (521 resets) in 180 ms. (221 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (518 resets) in 151 ms. (263 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (534 resets) in 181 ms. (219 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (524 resets) in 154 ms. (258 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (531 resets) in 176 ms. (226 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (537 resets) in 102 ms. (388 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (525 resets) in 107 ms. (370 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (532 resets) in 103 ms. (384 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (524 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (526 resets) in 97 ms. (408 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (523 resets) in 120 ms. (330 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (524 resets) in 95 ms. (416 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (518 resets) in 115 ms. (344 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (529 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (518 resets) in 124 ms. (320 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (515 resets) in 114 ms. (347 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (520 resets) in 113 ms. (350 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (528 resets) in 103 ms. (384 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (517 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (512 resets) in 123 ms. (322 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (520 resets) in 111 ms. (357 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (524 resets) in 93 ms. (425 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (533 resets) in 125 ms. (317 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (541 resets) in 113 ms. (350 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (532 resets) in 113 ms. (350 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (535 resets) in 117 ms. (339 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (521 resets) in 108 ms. (367 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (523 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (529 resets) in 125 ms. (317 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (520 resets) in 95 ms. (416 steps per ms) remains 138/138 properties
// Phase 1: matrix 548 rows 344 cols
[2025-06-01 01:10:08] [INFO ] Computed 18 invariants in 6 ms
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/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 100/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 106/344 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 548/892 variables, 344/362 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/892 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 892/892 variables, and 362 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 100/238 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:19] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:20] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:21] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:22] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:22] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:22] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:22] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 106/344 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:24] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:24] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:24] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:24] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:24] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:25] [INFO ] Deduced a trap composed of 56 places in 229 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:25] [INFO ] Deduced a trap composed of 56 places in 237 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:25] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:26] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:26] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:26] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:26] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:26] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:27] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:27] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:27] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:27] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:28] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:28] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:28] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:28] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:29] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:29] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:29] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:29] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:29] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:30] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:30] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:30] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:30] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:30] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:31] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:31] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:31] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:31] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:32] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:32] [INFO ] Deduced a trap composed of 69 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:32] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:32] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:32] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:33] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:33] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:33] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:34] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:34] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:34] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:35] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:36] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:36] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:36] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:36] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:36] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:37] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:37] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:37] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:38] [INFO ] Deduced a trap composed of 61 places in 238 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:38] [INFO ] Deduced a trap composed of 65 places in 225 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:39] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:39] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:39] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:39] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:40] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:40] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:40] [INFO ] Deduced a trap composed of 66 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:40] [INFO ] Deduced a trap composed of 66 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:40] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:41] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:41] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:41] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:41] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:41] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:41] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:42] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:42] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:42] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:42] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:43] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:43] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:43] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:44] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:44] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:44] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:44] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 24 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:45] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:46] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:46] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:47] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:47] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 25 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/344 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:47] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 16 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:50] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:50] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:50] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:51] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:51] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:51] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:51] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:51] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:52] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 33 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 9/141 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:52] [INFO ] Deduced a trap composed of 61 places in 243 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:53] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:53] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:54] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 24 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:55] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:56] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:56] [INFO ] Deduced a trap composed of 71 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:56] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:10:56] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 22 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 16 (OVERLAPS) 548/892 variables, 344/494 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/892 variables, 138/632 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:01] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:02] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:02] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 892/892 variables, and 635 constraints, problems are : Problem set: 0 solved, 138 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 135/135 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54070ms problems are : Problem set: 0 solved, 138 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 548/548 transitions.
Graph (complete) has 1000 edges and 344 vertex of which 335 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 335 transition count 484
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 75 rules applied. Total rules applied 140 place count 271 transition count 473
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 145 place count 266 transition count 473
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 145 place count 266 transition count 469
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 262 transition count 469
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 199 place count 216 transition count 363
Iterating global reduction 3 with 46 rules applied. Total rules applied 245 place count 216 transition count 363
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 250 place count 211 transition count 353
Iterating global reduction 3 with 5 rules applied. Total rules applied 255 place count 211 transition count 353
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 264 place count 211 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 288 place count 199 transition count 332
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 310 place count 188 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 311 place count 188 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 314 place count 188 transition count 375
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 188 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 316 place count 187 transition count 374
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 325 place count 187 transition count 374
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 332 place count 187 transition count 374
Applied a total of 332 rules in 130 ms. Remains 187 /344 variables (removed 157) and now considering 374/548 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 187/344 places, 374/548 transitions.
RANDOM walk for 4000000 steps (449768 resets) in 61306 ms. (65 steps per ms) remains 38/138 properties
BEST_FIRST walk for 400004 steps (4455 resets) in 548 ms. (728 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (4459 resets) in 652 ms. (612 steps per ms) remains 36/38 properties
BEST_FIRST walk for 400004 steps (4511 resets) in 648 ms. (616 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4492 resets) in 539 ms. (740 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4482 resets) in 602 ms. (663 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4485 resets) in 788 ms. (506 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4478 resets) in 787 ms. (507 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4482 resets) in 619 ms. (645 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4490 resets) in 598 ms. (667 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4504 resets) in 593 ms. (673 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4530 resets) in 534 ms. (747 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4488 resets) in 614 ms. (650 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4510 resets) in 523 ms. (763 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4461 resets) in 578 ms. (690 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4454 resets) in 561 ms. (711 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4495 resets) in 673 ms. (593 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4493 resets) in 524 ms. (761 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4471 resets) in 633 ms. (630 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (4472 resets) in 537 ms. (743 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4468 resets) in 662 ms. (603 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4500 resets) in 522 ms. (764 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4508 resets) in 615 ms. (649 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4460 resets) in 520 ms. (767 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4483 resets) in 614 ms. (650 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4470 resets) in 601 ms. (664 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4510 resets) in 646 ms. (618 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4459 resets) in 590 ms. (676 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (4500 resets) in 608 ms. (656 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (4491 resets) in 554 ms. (720 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (4475 resets) in 624 ms. (640 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (4469 resets) in 530 ms. (753 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (4522 resets) in 636 ms. (627 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (4519 resets) in 543 ms. (735 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (4469 resets) in 658 ms. (606 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (4508 resets) in 622 ms. (642 steps per ms) remains 35/35 properties
[2025-06-01 01:11:27] [INFO ] Flow matrix only has 350 transitions (discarded 24 similar events)
// Phase 1: matrix 350 rows 187 cols
[2025-06-01 01:11:27] [INFO ] Computed 9 invariants in 8 ms
[2025-06-01 01:11:27] [INFO ] State equation strengthened by 8 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 16/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 136/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 350/537 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 204 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 16/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 136/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 350/537 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:30] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:30] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:30] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:30] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:31] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:31] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:31] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:31] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:32] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:32] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:32] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:32] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:33] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:35] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 19 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/537 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/537 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:37] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:37] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:37] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:37] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:37] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 5 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/537 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:38] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:38] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:38] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/537 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:39] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:11:41] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 11 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/537 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 21 (OVERLAPS) 0/537 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 263 constraints, problems are : Problem set: 0 solved, 35 unsolved in 15300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16628ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 25 different solutions.
Parikh walk visited 14 properties in 258 ms.
Support contains 21 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 374/374 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 187 transition count 294
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 171 place count 107 transition count 283
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 191 place count 87 transition count 243
Iterating global reduction 2 with 20 rules applied. Total rules applied 211 place count 87 transition count 243
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 215 place count 83 transition count 235
Iterating global reduction 2 with 4 rules applied. Total rules applied 219 place count 83 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 220 place count 82 transition count 234
Iterating global reduction 2 with 1 rules applied. Total rules applied 221 place count 82 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 222 place count 81 transition count 230
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 81 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 229 place count 81 transition count 224
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 235 place count 78 transition count 221
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 241 place count 75 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 75 transition count 238
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 75 transition count 238
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 75 transition count 238
Applied a total of 247 rules in 48 ms. Remains 75 /187 variables (removed 112) and now considering 238/374 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 75/187 places, 238/374 transitions.
RANDOM walk for 4000000 steps (449808 resets) in 32109 ms. (124 steps per ms) remains 13/21 properties
BEST_FIRST walk for 4000003 steps (45336 resets) in 3972 ms. (1006 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (45321 resets) in 4115 ms. (971 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45438 resets) in 3871 ms. (1033 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (45417 resets) in 4048 ms. (987 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (45467 resets) in 3993 ms. (1001 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000003 steps (45466 resets) in 4582 ms. (872 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45420 resets) in 3946 ms. (1013 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45384 resets) in 4054 ms. (986 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45444 resets) in 3977 ms. (1005 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45357 resets) in 3938 ms. (1015 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45377 resets) in 3932 ms. (1017 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45488 resets) in 4165 ms. (960 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45351 resets) in 3951 ms. (1012 steps per ms) remains 13/13 properties
[2025-06-01 01:12:09] [INFO ] Flow matrix only has 216 transitions (discarded 22 similar events)
// Phase 1: matrix 216 rows 75 cols
[2025-06-01 01:12:09] [INFO ] Computed 9 invariants in 2 ms
[2025-06-01 01:12:09] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 58/75 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 216/291 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 115 constraints, problems are : Problem set: 0 solved, 13 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 4/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 58/75 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 216/291 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 13/128 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:12:10] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 129 constraints, problems are : Problem set: 0 solved, 13 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1309ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 238/238 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 75 transition count 230
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 67 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 66 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 66 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 64 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 63 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 63 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 62 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 62 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 62 transition count 213
Applied a total of 35 rules in 22 ms. Remains 62 /75 variables (removed 13) and now considering 213/238 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 62/75 places, 213/238 transitions.
RANDOM walk for 4000000 steps (449269 resets) in 26036 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (46021 resets) in 4082 ms. (979 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000004 steps (45887 resets) in 4029 ms. (992 steps per ms) remains 11/13 properties
BEST_FIRST walk for 4000004 steps (46003 resets) in 4089 ms. (977 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (45897 resets) in 3609 ms. (1108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (46026 resets) in 3662 ms. (1092 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (45948 resets) in 3866 ms. (1034 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (45902 resets) in 3951 ms. (1012 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (45962 resets) in 3769 ms. (1061 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (45907 resets) in 3854 ms. (1037 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (45908 resets) in 3612 ms. (1107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (45929 resets) in 3858 ms. (1036 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (45908 resets) in 3754 ms. (1065 steps per ms) remains 11/11 properties
[2025-06-01 01:12:31] [INFO ] Flow matrix only has 193 transitions (discarded 20 similar events)
// Phase 1: matrix 193 rows 62 cols
[2025-06-01 01:12:31] [INFO ] Computed 9 invariants in 2 ms
[2025-06-01 01:12:31] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 47/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 193/255 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 32/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/255 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 103 constraints, problems are : Problem set: 0 solved, 11 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 47/62 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 193/255 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 32/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 114 constraints, problems are : Problem set: 0 solved, 11 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 2 different solutions.
Finished Parikh walk after 134 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 11 properties in 14 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 360 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 176447 ms.

BK_STOP 1748740352365

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="HealthRecord-PT-17"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 HealthRecord-PT-17, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-smll-174867012900418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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