Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100182.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 MedleyA-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 160K 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 MedleyA-PT-11-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748861912825

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 10:58:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 10:58:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:58:35] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2025-06-02 10:58:35] [INFO ] Transformed 150 places.
[2025-06-02 10:58:35] [INFO ] Transformed 478 transitions.
[2025-06-02 10:58:36] [INFO ] Found NUPN structural information;
[2025-06-02 10:58:36] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 10:58:37] [INFO ] Flatten gal took : 203 ms
RANDOM walk for 40000 steps (3121 resets) in 3649 ms. (10 steps per ms) remains 11/15 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (548 resets) in 299 ms. (133 steps per ms) remains 10/11 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 10:58:37] [INFO ] Flatten gal took : 151 ms
BEST_FIRST walk for 40002 steps (544 resets) in 510 ms. (78 steps per ms) remains 9/10 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 10:58:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16823930385850815723.gal : 97 ms
BEST_FIRST walk for 40004 steps (483 resets) in 374 ms. (106 steps per ms) remains 9/9 properties
[2025-06-02 10:58:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18196297839445212062.prop : 8 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/ReachabilityCardinality16823930385850815723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18196297839445212062.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (547 resets) in 245 ms. (162 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (550 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality18196297839445212062.prop.
BEST_FIRST walk for 40004 steps (550 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (534 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :13 after 37
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :37 after 347
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :347 after 392
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :392 after 1071
BEST_FIRST walk for 40004 steps (537 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (484 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-04 does not hold.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1071 after 19619
BEST_FIRST walk for 40004 steps (479 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :19619 after 23481
[2025-06-02 10:58:38] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :23481 after 40851
[2025-06-02 10:58:38] [INFO ] Computed 23 invariants in 27 ms
[2025-06-02 10:58:38] [INFO ] State equation strengthened by 171 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :40851 after 49529
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 23/124 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 24/148 variables, 12/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 24/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 396/544 variables, 148/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :49529 after 284903
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 171/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/547 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1643 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 23/124 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 23/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:40] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:40] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :284903 after 365897
[2025-06-02 10:58:40] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 8 ms to minimize.
Problem MedleyA-PT-11-ReachabilityCardinality-2025-11 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/138 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2025-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 24/148 variables, 12/150 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 24/174 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:41] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:41] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:41] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:41] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:42] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:42] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:42] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:42] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:42] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:42] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:43] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:43] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:43] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:43] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:43] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-10 does not hold.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :365897 after 909909
[2025-06-02 10:58:44] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:44] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:44] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:44] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:44] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 20/194 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:45] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:45] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 19 ms to minimize.
SMT process timed out in 6947ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 69 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 148 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 135 transition count 448
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 135 transition count 448
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 133 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 45 place count 133 transition count 455
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 133 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 49 place count 131 transition count 456
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 131 transition count 456
Applied a total of 53 rules in 249 ms. Remains 131 /150 variables (removed 19) and now considering 456/469 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 131/150 places, 456/469 transitions.
RANDOM walk for 40000 steps (3835 resets) in 985 ms. (40 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (768 resets) in 300 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (697 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (770 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (763 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (684 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-06 does not hold.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :909909 after 2.39985e+06
Interrupted probabilistic random walk after 395962 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 5
Probabilistic random walk after 395962 steps, saw 81770 distinct states, run finished after 3014 ms. (steps per millisecond=131 ) properties seen :0
[2025-06-02 10:58:49] [INFO ] Flow matrix only has 384 transitions (discarded 72 similar events)
// Phase 1: matrix 384 rows 131 cols
[2025-06-02 10:58:49] [INFO ] Computed 23 invariants in 10 ms
[2025-06-02 10:58:49] [INFO ] State equation strengthened by 177 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2.39985e+06 after 3.65132e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 38/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 37/130 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 384/514 variables, 130/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 177/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/515 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/515 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 331 constraints, problems are : Problem set: 0 solved, 4 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 131/131 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 4/1 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 38/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:50] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 37/130 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:50] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:50] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:50] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:51] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:51] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:51] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:51] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:51] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:51] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:52] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:52] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:52] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:52] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:52] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:52] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 384/514 variables, 130/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/514 variables, 177/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:54] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:54] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:55] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 9 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :3.65132e+06 after 4.21322e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:55] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:58:56] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/515 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/515 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 354 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7310 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 131/131 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7977ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1130 ms.
Support contains 54 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 456/456 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 125 transition count 446
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 125 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 123 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 123 transition count 435
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 121 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 119 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 119 transition count 434
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 119 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 117 transition count 432
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 117 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 116 transition count 433
Applied a total of 30 rules in 67 ms. Remains 116 /131 variables (removed 15) and now considering 433/456 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 116/131 places, 433/456 transitions.
RANDOM walk for 40000 steps (4624 resets) in 838 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1061 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (958 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (901 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 528120 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 3
Probabilistic random walk after 528120 steps, saw 104800 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2025-06-02 10:59:02] [INFO ] Flow matrix only has 361 transitions (discarded 72 similar events)
// Phase 1: matrix 361 rows 116 cols
[2025-06-02 10:59:02] [INFO ] Computed 23 invariants in 4 ms
[2025-06-02 10:59:02] [INFO ] State equation strengthened by 175 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 31/115 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 361/476 variables, 115/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 175/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/477 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/477 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 314 constraints, problems are : Problem set: 0 solved, 3 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 116/116 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 3/0 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 31/115 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:02] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:02] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:03] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:04] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 361/476 variables, 115/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 175/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/477 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:04] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 14 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/477 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:05] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/477 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/477 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/477 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 327 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 116/116 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3453ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 377 ms.
Support contains 54 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 433/433 transitions.
Applied a total of 0 rules in 19 ms. Remains 116 /116 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 116/116 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 433/433 transitions.
Applied a total of 0 rules in 19 ms. Remains 116 /116 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2025-06-02 10:59:05] [INFO ] Flow matrix only has 361 transitions (discarded 72 similar events)
[2025-06-02 10:59:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:59:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 10:59:05] [INFO ] Flow matrix only has 361 transitions (discarded 72 similar events)
[2025-06-02 10:59:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:59:06] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-06-02 10:59:06] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:59:06] [INFO ] Redundant transitions in 30 ms returned []
Running 429 sub problems to find dead transitions.
[2025-06-02 10:59:06] [INFO ] Flow matrix only has 361 transitions (discarded 72 similar events)
[2025-06-02 10:59:06] [INFO ] Invariant cache hit.
[2025-06-02 10:59:06] [INFO ] State equation strengthened by 175 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :4.21322e+06 after 7.11473e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 321 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:11] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:12] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:13] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:13] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:13] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:13] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:13] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:14] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:14] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:14] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:14] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:14] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 19 ms to minimize.
Problem TDEAD370 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 20/43 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:16] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:16] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:16] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:16] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:16] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:16] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:17] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:17] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:17] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:17] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:17] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:18] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 12/55 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:18] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:18] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:19] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:19] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:19] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/60 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:20] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/61 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:23] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/62 constraints. Problems are: Problem set: 109 solved, 320 unsolved
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :7.11473e+06 after 2.8818e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/62 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 9 (OVERLAPS) 361/477 variables, 116/178 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 175/353 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/353 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/477 variables, and 353 constraints, problems are : Problem set: 109 solved, 320 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 116/116 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 14/14 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/23 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 39/62 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:39] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:39] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:39] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/65 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:40] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:40] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/67 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:42] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:42] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:42] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:43] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 4/71 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:44] [INFO ] Deduced a trap composed of 49 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-02 10:59:44] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:44] [INFO ] Deduced a trap composed of 31 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-02 10:59:45] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 4/75 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:59:46] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/76 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/76 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 361/477 variables, 116/192 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 175/367 constraints. Problems are: Problem set: 109 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 320/687 constraints. Problems are: Problem set: 109 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 687 constraints, problems are : Problem set: 109 solved, 320 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 116/116 constraints, ReadFeed: 175/175 constraints, PredecessorRefiner: 320/429 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60862ms problems are : Problem set: 109 solved, 320 unsolved
Search for dead transitions found 109 dead transitions in 60868ms
Found 109 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 109 transitions
Dead transitions reduction (with SMT) removed 109 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 116/116 places, 324/433 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 324
Applied a total of 3 rules in 28 ms. Remains 113 /116 variables (removed 3) and now considering 324/324 (removed 0) transitions.
// Phase 1: matrix 324 rows 113 cols
[2025-06-02 11:00:07] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:00:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 11:00:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:00:07] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-02 11:00:07] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 113/116 places, 324/433 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61913 ms. Remains : 113/116 places, 324/433 transitions.
RANDOM walk for 40000 steps (4631 resets) in 322 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1044 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (949 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (916 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 601535 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 3
Probabilistic random walk after 601535 steps, saw 117977 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-06-02 11:00:11] [INFO ] Invariant cache hit.
[2025-06-02 11:00:11] [INFO ] State equation strengthened by 139 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/105 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 7/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 324/436 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 139/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/437 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/437 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 272 constraints, problems are : Problem set: 0 solved, 3 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 3/1 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 51/105 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:11] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:11] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:11] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:11] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:12] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:13] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/112 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:13] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 324/436 variables, 112/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 139/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/437 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:14] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:14] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/437 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 289 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4165 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4557ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 305 ms.
Support contains 54 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 324/324 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 113/113 places, 324/324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 324/324 transitions.
Applied a total of 0 rules in 36 ms. Remains 113 /113 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2025-06-02 11:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:00:16] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 11:00:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 11:00:16] [INFO ] State equation strengthened by 139 read => feed constraints.
[2025-06-02 11:00:16] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 11:00:16] [INFO ] Redundant transitions in 18 ms returned []
Running 320 sub problems to find dead transitions.
[2025-06-02 11:00:16] [INFO ] Invariant cache hit.
[2025-06-02 11:00:16] [INFO ] State equation strengthened by 139 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:20] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:20] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:20] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:20] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:20] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:21] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:22] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:22] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:22] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:22] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:22] [INFO ] Deduced a trap composed of 36 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-02 11:00:22] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:22] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:24] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:24] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:24] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:24] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:25] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:25] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:25] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:25] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:25] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:26] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:26] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:26] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:26] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:26] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:27] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:27] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:27] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:27] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:27] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:28] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 324/437 variables, 113/173 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 139/312 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:33] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:33] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:34] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:35] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:35] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (OVERLAPS) 0/437 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 317 constraints, problems are : Problem set: 0 solved, 320 unsolved in 29880 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:48] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:48] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:48] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:48] [INFO ] Deduced a trap composed of 9 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-02 11:00:48] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:50] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:50] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:50] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:50] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:50] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:50] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:51] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:52] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:52] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:53] [INFO ] Deduced a trap composed of 28 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-02 11:00:53] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:53] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:53] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:53] [INFO ] Deduced a trap composed of 36 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-02 11:00:54] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:54] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:55] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:57] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:00:57] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 11 (OVERLAPS) 324/437 variables, 113/202 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 139/341 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 320/661 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 661 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60734 ms. Remains : 113/113 places, 324/324 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 520 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 110 transition count 306
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 110 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 109 transition count 305
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 109 transition count 305
Applied a total of 24 rules in 43 ms. Remains 109 /113 variables (removed 4) and now considering 305/324 (removed 19) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 305 rows 109 cols
[2025-06-02 11:01:16] [INFO ] Computed 17 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 11:01:16] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 11:01:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 11:01:16] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 11 ms returned sat
[2025-06-02 11:01:17] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:01:17] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:01:17] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 11:01:17] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
[2025-06-02 11:01:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
TRAPS : Iteration 1
[2025-06-02 11:01:17] [INFO ] After 659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-02 11:01:17] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-06-02 11:01:17] [INFO ] Flatten gal took : 45 ms
[2025-06-02 11:01:17] [INFO ] Flatten gal took : 43 ms
[2025-06-02 11:01:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7998034879735943023.gal : 7 ms
[2025-06-02 11:01:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9239890026440153992.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7998034879735943023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9239890026440153992.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/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
Loading property file /tmp/ReachabilityCardinality9239890026440153992.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :7 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :25 after 110
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :110 after 256
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :256 after 2082
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2082 after 9796
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :9796 after 29193
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :29193 after 318475
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :318475 after 488997
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :488997 after 5.48826e+06
Detected timeout of ITS tools.
[2025-06-02 11:01:32] [INFO ] Flatten gal took : 29 ms
[2025-06-02 11:01:32] [INFO ] Applying decomposition
[2025-06-02 11:01:32] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14172593918190868023.txt' '-o' '/tmp/graph14172593918190868023.bin' '-w' '/tmp/graph14172593918190868023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14172593918190868023.bin' '-l' '-1' '-v' '-w' '/tmp/graph14172593918190868023.weights' '-q' '0' '-e' '0.001'
[2025-06-02 11:01:33] [INFO ] Decomposing Gal with order
[2025-06-02 11:01:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 11:01:33] [INFO ] Removed a total of 415 redundant transitions.
[2025-06-02 11:01:33] [INFO ] Flatten gal took : 154 ms
[2025-06-02 11:01:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 24 ms.
[2025-06-02 11:01:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7292569332075230046.gal : 8 ms
[2025-06-02 11:01:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9937378528103398116.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7292569332075230046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9937378528103398116.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9937378528103398116.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5 after 13
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :13 after 6137
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6137 after 128749
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :128749 after 4.78934e+06
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-13 does not hold.
Reachability property MedleyA-PT-11-ReachabilityCardinality-2025-01 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.78934e+06 after 6.80136e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.80136e+08 after 1.18573e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.18573e+09 after 1.39873e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.39873e+09 after 2.81247e+09
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-03 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.16401e+10,12.4931,189652,4067,1666,256037,47855,451,785756,246,318973,0
Total reachable state count : 11640122698

Verifying 3 reachability properties.
Reachability property MedleyA-PT-11-ReachabilityCardinality-2025-01 is true.

Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31754 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 11:01:48] [INFO ] Flatten gal took : 47 ms
[2025-06-02 11:01:48] [INFO ] Applying decomposition
[2025-06-02 11:01:48] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6750450616917496248.txt' '-o' '/tmp/graph6750450616917496248.bin' '-w' '/tmp/graph6750450616917496248.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6750450616917496248.bin' '-l' '-1' '-v' '-w' '/tmp/graph6750450616917496248.weights' '-q' '0' '-e' '0.001'
[2025-06-02 11:01:48] [INFO ] Decomposing Gal with order
[2025-06-02 11:01:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 11:01:48] [INFO ] Removed a total of 891 redundant transitions.
[2025-06-02 11:01:49] [INFO ] Flatten gal took : 161 ms
[2025-06-02 11:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 21 ms.
[2025-06-02 11:01:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15619843603226269451.gal : 10 ms
[2025-06-02 11:01:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8000922709065341505.prop : 0 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/ReachabilityCardinality15619843603226269451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8000922709065341505.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8000922709065341505.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :3 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 26
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :26 after 38
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :38 after 218
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :218 after 218
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2721 after 5157
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :5157 after 54999
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :54999 after 3.22062e+06
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.22062e+06 after 3.73624e+06
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.73624e+06 after 8.6436e+06
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-13 does not hold.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-03 does not hold.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property MedleyA-PT-11-ReachabilityCardinality-2025-01 is true.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.61079e+07,174.61,2917108,45068,11363,1.14328e+06,150584,869,3.39512e+07,399,2.02958e+06,0
Total reachable state count : 46107894

Verifying 3 reachability properties.
Reachability property MedleyA-PT-11-ReachabilityCardinality-2025-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-11-ReachabilityCardinality-2025-01,9,189.264,2917108,48,76,1.14328e+06,150584,911,3.39512e+07,419,2.02958e+06,0
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-11-ReachabilityCardinality-2025-03,198178,213.355,2917108,1635,719,1.14328e+06,150584,1013,3.39512e+07,436,2.02958e+06,0
Invariant property MedleyA-PT-11-ReachabilityCardinality-2025-13 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-11-ReachabilityCardinality-2025-13,50926,219.153,2917108,722,1046,1.14328e+06,150584,1083,3.39512e+07,445,2.02958e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 413995 ms.

BK_STOP 1748862329392

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="MedleyA-PT-11"
export BK_EXAMINATION="ReachabilityCardinality"
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 MedleyA-PT-11, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524100182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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