Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K 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 18K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748912565856

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-03 01:02:47] [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-03 01:02:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 01:02:48] [INFO ] Load time of PNML (sax parser for PT used): 544 ms
[2025-06-03 01:02:48] [INFO ] Transformed 3606 places.
[2025-06-03 01:02:48] [INFO ] Transformed 5141 transitions.
[2025-06-03 01:02:48] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 734 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1267 resets) in 3929 ms. (10 steps per ms) remains 15/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (32 resets) in 115 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 133 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 81 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 139 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 171 ms. (23 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 165 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 113 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 137 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 184 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 129 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
[2025-06-03 01:02:50] [INFO ] Flatten gal took : 1319 ms
[2025-06-03 01:02:51] [INFO ] Flatten gal took : 506 ms
[2025-06-03 01:02:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2618148542882237523.gal : 212 ms
[2025-06-03 01:02:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9923199184106794085.prop : 17 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/ReachabilityCardinality2618148542882237523.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9923199184106794085.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/ReachabilityCardinality9923199184106794085.prop.
Interrupted probabilistic random walk after 21693 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 15
Probabilistic random walk after 21693 steps, saw 10269 distinct states, run finished after 3008 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-03 01:02:53] [INFO ] Flow matrix only has 4869 transitions (discarded 272 similar events)
// Phase 1: matrix 4869 rows 3606 cols
[2025-06-03 01:02:54] [INFO ] Computed 459 invariants in 321 ms
[2025-06-03 01:02:54] [INFO ] State equation strengthened by 1362 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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 683/924 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 33/957 variables, 32/42 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/957 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 2210/3167 variables, 244/286 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3167 variables, 0/286 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/3171 variables, 4/290 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3171 variables, 0/290 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 435/3606 variables, 169/459 constraints. Problems are: Problem set: 11 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3606 variables, 0/459 constraints. Problems are: Problem set: 11 solved, 4 unsolved
SMT process timed out in 5634ms, After SMT, problems are : Problem set: 11 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 3606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Graph (complete) has 12103 edges and 3606 vertex of which 3580 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.25 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 774 transitions
Trivial Post-agglo rules discarded 774 transitions
Performed 774 trivial Post agglomeration. Transition count delta: 774
Iterating post reduction 0 with 774 rules applied. Total rules applied 775 place count 3580 transition count 4367
Reduce places removed 774 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 1 with 802 rules applied. Total rules applied 1577 place count 2806 transition count 4339
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1605 place count 2778 transition count 4339
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 1605 place count 2778 transition count 4242
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 1799 place count 2681 transition count 4242
Discarding 688 places :
Symmetric choice reduction at 3 with 688 rule applications. Total rules 2487 place count 1993 transition count 3554
Iterating global reduction 3 with 688 rules applied. Total rules applied 3175 place count 1993 transition count 3554
Discarding 207 places :
Symmetric choice reduction at 3 with 207 rule applications. Total rules 3382 place count 1786 transition count 2933
Iterating global reduction 3 with 207 rules applied. Total rules applied 3589 place count 1786 transition count 2933
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3623 place count 1769 transition count 2916
Free-agglomeration rule (complex) applied 175 times.
Iterating global reduction 3 with 175 rules applied. Total rules applied 3798 place count 1769 transition count 3091
Reduce places removed 175 places and 0 transitions.
Iterating post reduction 3 with 175 rules applied. Total rules applied 3973 place count 1594 transition count 3091
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 4073 place count 1594 transition count 3091
Applied a total of 4073 rules in 1823 ms. Remains 1594 /3606 variables (removed 2012) and now considering 3091/5141 (removed 2050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1846 ms. Remains : 1594/3606 places, 3091/5141 transitions.
RANDOM walk for 40000 steps (2003 resets) in 1222 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (352 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (352 resets) in 399 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (352 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (352 resets) in 419 ms. (95 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 42889 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :0 out of 4
Probabilistic random walk after 42889 steps, saw 19260 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
[2025-06-03 01:03:04] [INFO ] Flow matrix only has 2699 transitions (discarded 392 similar events)
// Phase 1: matrix 2699 rows 1594 cols
[2025-06-03 01:03:05] [INFO ] Computed 433 invariants in 105 ms
[2025-06-03 01:03:05] [INFO ] State equation strengthened by 1298 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 941/999 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 478/1477 variables, 309/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 28/1505 variables, 28/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1505 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 89/1594 variables, 89/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1594 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2699/4293 variables, 1594/2027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4293 variables, 1298/3325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4293 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/4293 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4293/4293 variables, and 3325 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 400/400 constraints, State Equation: 1594/1594 constraints, ReadFeed: 1298/1298 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 941/999 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 478/1477 variables, 309/316 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:11] [INFO ] Deduced a trap composed of 7 places in 1566 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:12] [INFO ] Deduced a trap composed of 51 places in 1662 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :6 after 9
[2025-06-03 01:03:14] [INFO ] Deduced a trap composed of 51 places in 1807 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :9 after 25
[2025-06-03 01:03:16] [INFO ] Deduced a trap composed of 53 places in 1913 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :25 after 39
[2025-06-03 01:03:18] [INFO ] Deduced a trap composed of 53 places in 1619 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:20] [INFO ] Deduced a trap composed of 73 places in 1736 ms of which 200 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:21] [INFO ] Deduced a trap composed of 60 places in 1573 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :39 after 124
[2025-06-03 01:03:23] [INFO ] Deduced a trap composed of 73 places in 1777 ms of which 203 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:25] [INFO ] Deduced a trap composed of 73 places in 2027 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :124 after 155
[2025-06-03 01:03:27] [INFO ] Deduced a trap composed of 73 places in 1609 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :155 after 178
[2025-06-03 01:03:29] [INFO ] Deduced a trap composed of 73 places in 1761 ms of which 205 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:30] [INFO ] Deduced a trap composed of 73 places in 1742 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :178 after 358
[2025-06-03 01:03:32] [INFO ] Deduced a trap composed of 73 places in 1840 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :358 after 366
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :366 after 382
[2025-06-03 01:03:34] [INFO ] Deduced a trap composed of 73 places in 1707 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :382 after 406
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 69 places in 1715 ms of which 186 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:37] [INFO ] Deduced a trap composed of 56 places in 1701 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:39] [INFO ] Deduced a trap composed of 73 places in 1720 ms of which 198 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:41] [INFO ] Deduced a trap composed of 69 places in 1806 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:43] [INFO ] Deduced a trap composed of 72 places in 1692 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:44] [INFO ] Deduced a trap composed of 54 places in 1685 ms of which 147 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 20/336 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:46] [INFO ] Deduced a trap composed of 54 places in 1669 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:48] [INFO ] Deduced a trap composed of 55 places in 1886 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:50] [INFO ] Deduced a trap composed of 74 places in 1692 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :406 after 599
[2025-06-03 01:03:52] [INFO ] Deduced a trap composed of 69 places in 1800 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:53] [INFO ] Deduced a trap composed of 73 places in 1500 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:55] [INFO ] Deduced a trap composed of 71 places in 1620 ms of which 183 ms to minimize.
SMT process timed out in 50479ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 1594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1594/1594 places, 3091/3091 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1594 transition count 3081
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1584 transition count 3081
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 1584 transition count 3077
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 1580 transition count 3077
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1579 transition count 3076
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1579 transition count 3076
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 41 place count 1579 transition count 3115
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 52 place count 1568 transition count 3115
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 70 place count 1568 transition count 3115
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 87 place count 1551 transition count 3098
Iterating global reduction 3 with 17 rules applied. Total rules applied 104 place count 1551 transition count 3098
Applied a total of 104 rules in 780 ms. Remains 1551 /1594 variables (removed 43) and now considering 3098/3091 (removed -7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 780 ms. Remains : 1551/1594 places, 3098/3091 transitions.
RANDOM walk for 40000 steps (2059 resets) in 1188 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (353 resets) in 335 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (352 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 47888 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 47888 steps, saw 21397 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 01:03:59] [INFO ] Flow matrix only has 2702 transitions (discarded 396 similar events)
// Phase 1: matrix 2702 rows 1551 cols
[2025-06-03 01:03:59] [INFO ] Computed 433 invariants in 50 ms
[2025-06-03 01:03:59] [INFO ] State equation strengthened by 1348 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 976/992 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/992 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 468/1460 variables, 337/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1460 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/1488 variables, 28/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1488 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 63/1551 variables, 63/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1551 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2702/4253 variables, 1551/1984 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4253 variables, 1348/3332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4253 variables, 0/3332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4253 variables, 0/3332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4253/4253 variables, and 3332 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2391 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 400/400 constraints, State Equation: 1551/1551 constraints, ReadFeed: 1348/1348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 976/992 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:03] [INFO ] Deduced a trap composed of 263 places in 632 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:03] [INFO ] Deduced a trap composed of 265 places in 620 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:04] [INFO ] Deduced a trap composed of 262 places in 502 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:04] [INFO ] Deduced a trap composed of 272 places in 619 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:05] [INFO ] Deduced a trap composed of 262 places in 638 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:06] [INFO ] Deduced a trap composed of 308 places in 615 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:06] [INFO ] Deduced a trap composed of 282 places in 496 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/992 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/992 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 468/1460 variables, 337/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:08] [INFO ] Deduced a trap composed of 5 places in 1693 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:10] [INFO ] Deduced a trap composed of 28 places in 1724 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:12] [INFO ] Deduced a trap composed of 42 places in 2004 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:14] [INFO ] Deduced a trap composed of 42 places in 2035 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :599 after 898
[2025-06-03 01:04:16] [INFO ] Deduced a trap composed of 44 places in 1779 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:18] [INFO ] Deduced a trap composed of 47 places in 1913 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:20] [INFO ] Deduced a trap composed of 61 places in 1882 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:22] [INFO ] Deduced a trap composed of 58 places in 1909 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:24] [INFO ] Deduced a trap composed of 58 places in 1985 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:26] [INFO ] Deduced a trap composed of 58 places in 1901 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :898 after 1189
[2025-06-03 01:04:27] [INFO ] Deduced a trap composed of 58 places in 1789 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:29] [INFO ] Deduced a trap composed of 44 places in 1768 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:31] [INFO ] Deduced a trap composed of 61 places in 1877 ms of which 180 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:33] [INFO ] Deduced a trap composed of 59 places in 1937 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:35] [INFO ] Deduced a trap composed of 28 places in 1749 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:37] [INFO ] Deduced a trap composed of 42 places in 1953 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:39] [INFO ] Deduced a trap composed of 43 places in 1815 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:41] [INFO ] Deduced a trap composed of 43 places in 1898 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:43] [INFO ] Deduced a trap composed of 58 places in 1864 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:45] [INFO ] Deduced a trap composed of 61 places in 2116 ms of which 178 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1460 variables, 20/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:47] [INFO ] Deduced a trap composed of 61 places in 1965 ms of which 171 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:49] [INFO ] Deduced a trap composed of 58 places in 1776 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:50] [INFO ] Deduced a trap composed of 44 places in 1715 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:52] [INFO ] Deduced a trap composed of 61 places in 1752 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:54] [INFO ] Deduced a trap composed of 62 places in 1929 ms of which 181 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:56] [INFO ] Deduced a trap composed of 62 places in 1674 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:58] [INFO ] Deduced a trap composed of 45 places in 1785 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:59] [INFO ] Deduced a trap composed of 45 places in 1710 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:01] [INFO ] Deduced a trap composed of 45 places in 1653 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:03] [INFO ] Deduced a trap composed of 45 places in 1620 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:05] [INFO ] Deduced a trap composed of 45 places in 1705 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:06] [INFO ] Deduced a trap composed of 60 places in 1728 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:08] [INFO ] Deduced a trap composed of 60 places in 1760 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:10] [INFO ] Deduced a trap composed of 60 places in 1759 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:12] [INFO ] Deduced a trap composed of 60 places in 1804 ms of which 176 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:14] [INFO ] Deduced a trap composed of 60 places in 2021 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:16] [INFO ] Deduced a trap composed of 61 places in 1836 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:18] [INFO ] Deduced a trap composed of 63 places in 1796 ms of which 169 ms to minimize.
SMT process timed out in 78226ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 3098/3098 transitions.
Applied a total of 0 rules in 138 ms. Remains 1551 /1551 variables (removed 0) and now considering 3098/3098 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 1551/1551 places, 3098/3098 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 3098/3098 transitions.
Applied a total of 0 rules in 118 ms. Remains 1551 /1551 variables (removed 0) and now considering 3098/3098 (removed 0) transitions.
[2025-06-03 01:05:18] [INFO ] Flow matrix only has 2702 transitions (discarded 396 similar events)
[2025-06-03 01:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:27] [INFO ] Implicit Places using invariants in 9420 ms returned [4, 7, 9, 10, 11, 12, 16, 22, 30, 40, 52, 66, 81, 95, 96, 97, 98, 110, 120, 128, 134, 138, 140, 149, 155, 158, 159, 160, 163, 167, 173, 181, 191, 203, 216, 228, 229, 230, 231, 241, 249, 255, 259, 261, 263, 272, 278, 281, 282, 283, 284, 286, 289, 293, 299, 307, 317, 328, 338, 339, 340, 341, 349, 355, 359, 361, 363, 365, 374, 380, 383, 384, 385, 387, 389, 392, 396, 403, 411, 420, 428, 429, 430, 431, 437, 441, 443, 445, 447, 449, 458, 464, 466, 467, 468, 469, 471, 473, 475, 477, 481, 487, 494, 501, 502, 503, 507, 509, 511, 513, 515, 517, 528, 534, 536, 537, 538, 539, 541, 543, 545, 547, 549, 553, 558, 562, 563, 564, 565, 567, 569, 571, 573, 575, 577, 586, 592, 594, 595, 596, 597, 599, 601, 603, 605, 607, 609, 612, 614, 615, 617, 619, 621, 623, 625, 627, 629, 640, 646, 648, 649, 650, 651, 653, 655, 657, 659, 661, 663, 665, 667, 668, 669, 670, 672, 674, 676, 678, 680, 682, 692, 694, 697, 699, 700, 701, 702, 704, 706, 708, 710, 712, 714, 717, 719, 720, 721, 722, 724, 726, 728, 730, 732, 734, 743, 749, 751, 752, 753, 754, 756, 758, 760, 762, 764, 766, 768, 770, 771, 772, 773, 775, 777, 779, 781, 783, 785, 794, 800, 802, 803, 804, 805, 807, 809, 811, 813, 815, 817, 819, 822, 823, 824, 825, 828, 830, 832, 834, 836, 838, 847, 853, 855, 856, 857, 858, 860, 862, 864, 866, 868, 870, 874, 879, 880, 881, 882, 886, 888, 890, 892, 894, 896, 905, 911, 913, 914, 915, 916, 918, 920, 922, 924, 926, 930, 936, 943, 944, 945, 946, 952, 956, 958, 960, 962, 964, 973, 979, 981, 982, 984, 986, 988, 990, 992, 996, 1002, 1012, 1021, 1022, 1024, 1032, 1038, 1043, 1045, 1047, 1049, 1058, 1064, 1066, 1067, 1068, 1069, 1071, 1073, 1075, 1079, 1085, 1093, 1103, 1114, 1115, 1116, 1117, 1127, 1135, 1141, 1145, 1147, 1149, 1158, 1164, 1166, 1167, 1168, 1169, 1171, 1173, 1177, 1183, 1191, 1201, 1213, 1227, 1228, 1229, 1241, 1251, 1260, 1266, 1270, 1272, 1281, 1283, 1286, 1288, 1290, 1291, 1293, 1297, 1303, 1313, 1323, 1335, 1349, 1364, 1365, 1366, 1367, 1381, 1393, 1403, 1411, 1417, 1421, 1430]
[2025-06-03 01:05:27] [INFO ] Actually due to overlaps returned [374, 847, 905, 973, 1058, 1158, 1281, 1430, 149, 272, 458, 528, 586, 640, 743, 794, 692, 4, 9, 10, 11, 95, 96, 97, 158, 159, 228, 229, 230, 281, 282, 283, 338, 339, 340, 383, 384, 428, 429, 430, 466, 467, 468, 501, 502, 536, 537, 538, 562, 563, 564, 594, 595, 596, 614, 615, 648, 649, 650, 667, 668, 669, 694, 699, 700, 701, 719, 720, 721, 751, 752, 753, 770, 771, 772, 802, 803, 804, 822, 823, 824, 855, 856, 857, 879, 880, 881, 913, 914, 915, 943, 944, 945, 981, 982, 1021, 1022, 1066, 1067, 1068, 1114, 1115, 1116, 1166, 1167, 1168, 1227, 1228, 1283, 1288, 1290, 1364, 1365, 1366]
Discarding 114 places :
Implicit Place search using SMT only with invariants took 9450 ms to find 114 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1437/1551 places, 3098/3098 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 87 place count 1350 transition count 3011
Iterating global reduction 0 with 87 rules applied. Total rules applied 174 place count 1350 transition count 3011
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 261 place count 1263 transition count 2924
Iterating global reduction 0 with 87 rules applied. Total rules applied 348 place count 1263 transition count 2924
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 351 place count 1263 transition count 2921
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 354 place count 1260 transition count 2921
Applied a total of 354 rules in 329 ms. Remains 1260 /1437 variables (removed 177) and now considering 2921/3098 (removed 177) transitions.
[2025-06-03 01:05:28] [INFO ] Flow matrix only has 2525 transitions (discarded 396 similar events)
// Phase 1: matrix 2525 rows 1260 cols
[2025-06-03 01:05:28] [INFO ] Computed 319 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:05:31] [INFO ] Implicit Places using invariants in 3829 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 146, 149, 152, 156, 162, 170, 180, 192, 205, 217, 227, 235, 241, 245, 247, 249, 258, 261, 263, 266, 270, 276, 284, 294, 305, 315, 323, 329, 333, 335, 337, 339, 347, 350, 352, 354, 357, 361, 368, 376, 385, 393, 399, 403, 405, 407, 409, 411, 420, 422, 424, 426, 428, 430, 434, 440, 447, 454, 458, 460, 462, 464, 466, 468, 479, 481, 483, 485, 487, 489, 491, 495, 500, 504, 506, 508, 510, 512, 514, 516, 524, 526, 528, 530, 532, 534, 536, 538, 541, 544, 546, 548, 550, 552, 554, 556, 567, 569, 571, 573, 575, 577, 579, 581, 583, 585, 587, 589, 591, 593, 595, 597, 605, 607, 609, 611, 613, 615, 617, 619, 622, 624, 626, 628, 630, 632, 634, 636, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 665, 667, 669, 671, 673, 681, 683, 685, 687, 689, 691, 693, 695, 697, 700, 703, 705, 707, 709, 711, 713, 721, 723, 725, 727, 729, 731, 733, 735, 739, 744, 748, 750, 752, 754, 756, 758, 766, 768, 770, 772, 774, 776, 778, 782, 788, 795, 801, 805, 807, 809, 811, 813, 821, 824, 826, 828, 830, 832, 836, 842, 852, 862, 870, 876, 881, 883, 885, 887, 897, 899, 901, 903, 905, 909, 915, 923, 933, 944, 954, 962, 968, 972, 974, 976, 984, 986, 988, 990, 994, 1000, 1008, 1018, 1030, 1044, 1056, 1066, 1075, 1081, 1085, 1087, 1094, 1097, 1099, 1103, 1109, 1119, 1129, 1141, 1155, 1170, 1184, 1196, 1206, 1214, 1220, 1224]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 3844 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 988/1551 places, 2921/3098 transitions.
Applied a total of 0 rules in 103 ms. Remains 988 /988 variables (removed 0) and now considering 2921/2921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 13846 ms. Remains : 988/1551 places, 2921/3098 transitions.
RANDOM walk for 40000 steps (2231 resets) in 1096 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (223 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (230 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 57338 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 57338 steps, saw 24142 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
[2025-06-03 01:05:35] [INFO ] Flow matrix only has 2525 transitions (discarded 396 similar events)
// Phase 1: matrix 2525 rows 988 cols
[2025-06-03 01:05:35] [INFO ] Computed 47 invariants in 31 ms
[2025-06-03 01:05:35] [INFO ] State equation strengthened by 1348 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 902/918 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/918 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/954 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/954 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/982 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/982 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/988 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/988 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2525/3513 variables, 988/1035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3513 variables, 1348/2383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3513 variables, 0/2383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3513 variables, 0/2383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3513/3513 variables, and 2383 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3703 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 988/988 constraints, ReadFeed: 1348/1348 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 902/918 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:40] [INFO ] Deduced a trap composed of 109 places in 1093 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:41] [INFO ] Deduced a trap composed of 92 places in 1017 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:42] [INFO ] Deduced a trap composed of 123 places in 876 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:43] [INFO ] Deduced a trap composed of 189 places in 1072 ms of which 204 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:44] [INFO ] Deduced a trap composed of 93 places in 965 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:45] [INFO ] Deduced a trap composed of 163 places in 1065 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:46] [INFO ] Deduced a trap composed of 124 places in 1019 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:47] [INFO ] Deduced a trap composed of 142 places in 978 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:48] [INFO ] Deduced a trap composed of 92 places in 974 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:49] [INFO ] Deduced a trap composed of 93 places in 1009 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:50] [INFO ] Deduced a trap composed of 99 places in 982 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:51] [INFO ] Deduced a trap composed of 92 places in 907 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:52] [INFO ] Deduced a trap composed of 109 places in 1009 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:53] [INFO ] Deduced a trap composed of 141 places in 1001 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:54] [INFO ] Deduced a trap composed of 99 places in 1001 ms of which 130 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/918 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/918 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/954 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:55] [INFO ] Deduced a trap composed of 5 places in 1027 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:56] [INFO ] Deduced a trap composed of 28 places in 1058 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:57] [INFO ] Deduced a trap composed of 28 places in 1089 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:59] [INFO ] Deduced a trap composed of 58 places in 1084 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:00] [INFO ] Deduced a trap composed of 47 places in 1362 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:01] [INFO ] Deduced a trap composed of 62 places in 1137 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:02] [INFO ] Deduced a trap composed of 63 places in 1110 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:03] [INFO ] Deduced a trap composed of 67 places in 1127 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:05] [INFO ] Deduced a trap composed of 67 places in 1150 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:06] [INFO ] Deduced a trap composed of 62 places in 1097 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:07] [INFO ] Deduced a trap composed of 62 places in 874 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:08] [INFO ] Deduced a trap composed of 62 places in 1102 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:09] [INFO ] Deduced a trap composed of 68 places in 1072 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:10] [INFO ] Deduced a trap composed of 69 places in 1010 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:11] [INFO ] Deduced a trap composed of 67 places in 1063 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:12] [INFO ] Deduced a trap composed of 57 places in 1037 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:13] [INFO ] Deduced a trap composed of 64 places in 1023 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:14] [INFO ] Deduced a trap composed of 60 places in 1058 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:15] [INFO ] Deduced a trap composed of 67 places in 1090 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:16] [INFO ] Deduced a trap composed of 61 places in 1080 ms of which 98 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/954 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:17] [INFO ] Deduced a trap composed of 77 places in 978 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:18] [INFO ] Deduced a trap composed of 62 places in 1124 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:19] [INFO ] Deduced a trap composed of 87 places in 1015 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:21] [INFO ] Deduced a trap composed of 63 places in 1042 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:22] [INFO ] Deduced a trap composed of 70 places in 1045 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 63 places in 1085 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:24] [INFO ] Deduced a trap composed of 94 places in 994 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:25] [INFO ] Deduced a trap composed of 62 places in 1038 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:26] [INFO ] Deduced a trap composed of 65 places in 1145 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:27] [INFO ] Deduced a trap composed of 63 places in 1024 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:28] [INFO ] Deduced a trap composed of 66 places in 1026 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:29] [INFO ] Deduced a trap composed of 69 places in 1274 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:30] [INFO ] Deduced a trap composed of 72 places in 1055 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:31] [INFO ] Deduced a trap composed of 70 places in 1037 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:33] [INFO ] Deduced a trap composed of 73 places in 1037 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:34] [INFO ] Deduced a trap composed of 62 places in 1274 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:35] [INFO ] Deduced a trap composed of 87 places in 1127 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:36] [INFO ] Deduced a trap composed of 65 places in 1087 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:37] [INFO ] Deduced a trap composed of 97 places in 1019 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:38] [INFO ] Deduced a trap composed of 63 places in 1104 ms of which 111 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/954 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 131072
SDD size :1189 after 4290
[2025-06-03 01:06:40] [INFO ] Deduced a trap composed of 61 places in 1244 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:41] [INFO ] Deduced a trap composed of 64 places in 1232 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:42] [INFO ] Deduced a trap composed of 47 places in 1228 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:43] [INFO ] Deduced a trap composed of 60 places in 1162 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:44] [INFO ] Deduced a trap composed of 61 places in 1026 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:45] [INFO ] Deduced a trap composed of 62 places in 1027 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:46] [INFO ] Deduced a trap composed of 65 places in 1036 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:47] [INFO ] Deduced a trap composed of 63 places in 1037 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:48] [INFO ] Deduced a trap composed of 66 places in 1022 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:50] [INFO ] Deduced a trap composed of 47 places in 1001 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:51] [INFO ] Deduced a trap composed of 59 places in 1022 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:52] [INFO ] Deduced a trap composed of 60 places in 1023 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:53] [INFO ] Deduced a trap composed of 67 places in 1033 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:54] [INFO ] Deduced a trap composed of 63 places in 1039 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:55] [INFO ] Deduced a trap composed of 47 places in 1023 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:56] [INFO ] Deduced a trap composed of 59 places in 1028 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:57] [INFO ] Deduced a trap composed of 61 places in 1041 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:58] [INFO ] Deduced a trap composed of 64 places in 1040 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:59] [INFO ] Deduced a trap composed of 60 places in 1037 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:00] [INFO ] Deduced a trap composed of 59 places in 1035 ms of which 105 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/954 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:01] [INFO ] Deduced a trap composed of 62 places in 1040 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:03] [INFO ] Deduced a trap composed of 63 places in 1141 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:04] [INFO ] Deduced a trap composed of 63 places in 1062 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:05] [INFO ] Deduced a trap composed of 72 places in 1191 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:06] [INFO ] Deduced a trap composed of 59 places in 1154 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:08] [INFO ] Deduced a trap composed of 62 places in 1134 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:09] [INFO ] Deduced a trap composed of 63 places in 969 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:10] [INFO ] Deduced a trap composed of 60 places in 1148 ms of which 106 ms to minimize.
SMT process timed out in 94854ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 2921/2921 transitions.
Applied a total of 0 rules in 89 ms. Remains 988 /988 variables (removed 0) and now considering 2921/2921 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 988/988 places, 2921/2921 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 2921/2921 transitions.
Applied a total of 0 rules in 88 ms. Remains 988 /988 variables (removed 0) and now considering 2921/2921 (removed 0) transitions.
[2025-06-03 01:07:10] [INFO ] Flow matrix only has 2525 transitions (discarded 396 similar events)
[2025-06-03 01:07:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:07:12] [INFO ] Implicit Places using invariants in 2199 ms returned []
[2025-06-03 01:07:12] [INFO ] Flow matrix only has 2525 transitions (discarded 396 similar events)
[2025-06-03 01:07:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:07:13] [INFO ] State equation strengthened by 1348 read => feed constraints.
[2025-06-03 01:07:44] [INFO ] Performed 516/988 implicitness test of which 0 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,15 properties remain. new max is 262144
SDD size :4290 after 5433
[2025-06-03 01:08:12] [INFO ] Implicit Places using invariants and state equation in 59515 ms returned []
Implicit Place search using SMT with State Equation took 61722 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:08:12] [INFO ] Redundant transitions in 260 ms returned []
Running 2859 sub problems to find dead transitions.
[2025-06-03 01:08:12] [INFO ] Flow matrix only has 2525 transitions (discarded 396 similar events)
[2025-06-03 01:08:12] [INFO ] Invariant cache hit.
[2025-06-03 01:08:12] [INFO ] State equation strengthened by 1348 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/986 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2859 unsolved
SMT process timed out in 33605ms, After SMT, problems are : Problem set: 0 solved, 2859 unsolved
Search for dead transitions found 0 dead transitions in 33633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95733 ms. Remains : 988/988 places, 2921/2921 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1047 edges and 988 vertex of which 17 / 988 are part of one of the 1 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 297 transitions
Ensure Unique test removed 371 transitions
Reduce isomorphic transitions removed 668 transitions.
Graph (complete) has 3552 edges and 972 vertex of which 958 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 941 transition count 2155
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 286 rules applied. Total rules applied 386 place count 845 transition count 1965
Reduce places removed 94 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 259 rules applied. Total rules applied 645 place count 751 transition count 1800
Reduce places removed 71 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 3 with 210 rules applied. Total rules applied 855 place count 680 transition count 1661
Reduce places removed 68 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 186 rules applied. Total rules applied 1041 place count 612 transition count 1543
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 147 rules applied. Total rules applied 1188 place count 562 transition count 1446
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 125 rules applied. Total rules applied 1313 place count 515 transition count 1368
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1404 place count 484 transition count 1308
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 76 rules applied. Total rules applied 1480 place count 455 transition count 1261
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1532 place count 437 transition count 1227
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1572 place count 421 transition count 1203
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1594 place count 413 transition count 1189
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1608 place count 407 transition count 1181
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 13 with 8 rules applied. Total rules applied 1616 place count 405 transition count 1175
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 1624 place count 401 transition count 1171
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 15 Pre rules applied. Total rules applied 1624 place count 401 transition count 1156
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 30 rules applied. Total rules applied 1654 place count 386 transition count 1156
Discarding 261 places :
Symmetric choice reduction at 15 with 261 rule applications. Total rules 1915 place count 125 transition count 417
Iterating global reduction 15 with 261 rules applied. Total rules applied 2176 place count 125 transition count 417
Ensure Unique test removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Iterating post reduction 15 with 171 rules applied. Total rules applied 2347 place count 125 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2347 place count 125 transition count 245
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2349 place count 124 transition count 245
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2351 place count 122 transition count 233
Iterating global reduction 16 with 2 rules applied. Total rules applied 2353 place count 122 transition count 233
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2355 place count 120 transition count 231
Iterating global reduction 16 with 2 rules applied. Total rules applied 2357 place count 120 transition count 231
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 2379 place count 109 transition count 220
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2380 place count 108 transition count 214
Iterating global reduction 16 with 1 rules applied. Total rules applied 2381 place count 108 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2383 place count 107 transition count 215
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2384 place count 106 transition count 212
Iterating global reduction 16 with 1 rules applied. Total rules applied 2385 place count 106 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2391 place count 106 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 2393 place count 106 transition count 204
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2397 place count 106 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 2401 place count 102 transition count 200
Partial Free-agglomeration rule applied 49 times.
Drop transitions (Partial Free agglomeration) removed 49 transitions
Iterating global reduction 18 with 49 rules applied. Total rules applied 2450 place count 102 transition count 200
Applied a total of 2450 rules in 820 ms. Remains 102 /988 variables (removed 886) and now considering 200/2921 (removed 2721) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 200 rows 102 cols
[2025-06-03 01:08:46] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 01:08:46] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-03 01:08:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-03 01:08:47] [INFO ] [Nat]Absence check using 3 positive and 14 generalized place invariants in 8 ms returned sat
[2025-06-03 01:08:47] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-03 01:08:47] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-03 01:08:47] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-03 01:08:47] [INFO ] Flatten gal took : 11 ms
[2025-06-03 01:08:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 01:08:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2955356594958362877.gal : 3 ms
[2025-06-03 01:08:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6395542116862170397.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/ReachabilityCardinality2955356594958362877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6395542116862170397.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/ReachabilityCardinality6395542116862170397.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 41
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :41 after 47
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :47 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 75
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :75 after 316
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :316 after 497
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :497 after 2032
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2032 after 3351
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3351 after 12045
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,15173,0.292529,11764,2,4745,14,18277,8,0,606,20341,0
Total reachable state count : 15173

Verifying 2 reachability properties.
Invariant property MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-02 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
MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-02,107,0.294208,11764,2,296,14,18277,8,0,612,20341,0
Invariant property MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-06 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
MultiCrashLeafsetExtension-PT-S16C03-ReachabilityCardinality-2025-06,1,0.295885,12020,2,103,14,18277,8,0,626,20341,0
Over-approximation ignoring read arcs solved 0 properties in 1488 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 01:08:48] [INFO ] Flatten gal took : 197 ms
[2025-06-03 01:08:48] [INFO ] Applying decomposition
[2025-06-03 01:08:48] [INFO ] Flatten gal took : 203 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/graph3516535814465891956.txt' '-o' '/tmp/graph3516535814465891956.bin' '-w' '/tmp/graph3516535814465891956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3516535814465891956.bin' '-l' '-1' '-v' '-w' '/tmp/graph3516535814465891956.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:08:49] [INFO ] Decomposing Gal with order
[2025-06-03 01:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:08:50] [INFO ] Removed a total of 2783 redundant transitions.
[2025-06-03 01:08:51] [INFO ] Flatten gal took : 1268 ms
[2025-06-03 01:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 189 ms.
[2025-06-03 01:08:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14071307790409023140.gal : 64 ms
[2025-06-03 01:08:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5202957007690102574.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/ReachabilityCardinality14071307790409023140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5202957007690102574.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 ...329
Loading property file /tmp/ReachabilityCardinality5202957007690102574.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 34
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :34 after 37
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :37 after 90
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :90 after 94
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :94 after 102
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :102 after 118
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :118 after 146
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :146 after 506
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :506 after 1087
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1087 after 2057
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2057 after 3603
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3603 after 7670
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :7670 after 12198
Detected timeout of ITS tools.
[2025-06-03 01:39:00] [INFO ] Flatten gal took : 3099 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5744279148128555158
[2025-06-03 01:39:01] [INFO ] Too many transitions (2921) to apply POR reductions. Disabling POR matrices.
[2025-06-03 01:39:02] [INFO ] Applying decomposition
[2025-06-03 01:39:04] [INFO ] Built C files in 2233ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5744279148128555158
Running compilation step : cd /tmp/ltsmin5744279148128555158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 01:39:05] [INFO ] Flatten gal took : 2612 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/graph10594184954839073875.txt' '-o' '/tmp/graph10594184954839073875.bin' '-w' '/tmp/graph10594184954839073875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10594184954839073875.bin' '-l' '-1' '-v' '-w' '/tmp/graph10594184954839073875.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:39:12] [INFO ] Decomposing Gal with order
[2025-06-03 01:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:39:12] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-03 01:39:12] [INFO ] Flatten gal took : 220 ms
[2025-06-03 01:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 13 ms.
[2025-06-03 01:39:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9526391203826085221.gal : 30 ms
[2025-06-03 01:39:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7629067462934185763.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/ReachabilityCardinality9526391203826085221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7629067462934185763.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/ReachabilityCardinality7629067462934185763.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 71
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :71 after 75
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :75 after 77
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :77 after 85
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 215
Compilation finished in 13821 ms.
Running link step : cd /tmp/ltsmin5744279148128555158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin5744279148128555158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityCardinality202502==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :215 after 476
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :476 after 982
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :982 after 1940
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1940 after 3583
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3583 after 5807
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5807 after 9619
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :9619 after 17255
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :17255 after 29940
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin5744279148128555158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityCardinality202502==true'
Running LTSmin : cd /tmp/ltsmin5744279148128555158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'MultiCrashLeafsetExtensionPTS16C03ReachabilityCardinality202506==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MultiCrashLeafsetExtension-PT-S16C03"
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 MultiCrashLeafsetExtension-PT-S16C03, 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-174876524300294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C03.tgz
mv MultiCrashLeafsetExtension-PT-S16C03 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 ;