Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532500295.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 ShieldIIPs-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532500295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 49K 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 ShieldIIPs-PT-003B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749026554900

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 08:42:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 08:42:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:42:36] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-04 08:42:36] [INFO ] Transformed 183 places.
[2025-06-04 08:42:36] [INFO ] Transformed 180 transitions.
[2025-06-04 08:42:36] [INFO ] Found NUPN structural information;
[2025-06-04 08:42:36] [INFO ] Parsed PT model containing 183 places and 180 transitions and 540 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (87 resets) in 1011 ms. (39 steps per ms) remains 2/16 properties
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 08:42:36] [INFO ] Flatten gal took : 70 ms
[2025-06-04 08:42:36] [INFO ] Flatten gal took : 33 ms
[2025-06-04 08:42:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18223247470976718677.gal : 39 ms
[2025-06-04 08:42:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7836514236522134652.prop : 2 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/ReachabilityCardinality18223247470976718677.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7836514236522134652.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (15 resets) in 647 ms. (61 steps per ms) remains 2/2 properties

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/ReachabilityCardinality7836514236522134652.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 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 111
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :111 after 1136
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1136 after 641847
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.28818e+08 after 3.66839e+08
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.66839e+08 after 3.66842e+08
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3.66842e+08 after 3.66868e+08
BEST_FIRST walk for 40003 steps (19 resets) in 305 ms. (130 steps per ms) remains 1/2 properties
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 180 rows 183 cols
[2025-06-04 08:42:36] [INFO ] Computed 28 invariants in 14 ms
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/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 123/144 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 123/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 39/183 variables, 10/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 39/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 180/363 variables, 183/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 123/144 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 123/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:37] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:37] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/183 variables, 10/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 39/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:37] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:37] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 180/363 variables, 183/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:38] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:39] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:39] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:39] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 13/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/363 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/363 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2087 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 21 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 180/180 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 183 transition count 170
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 15 rules applied. Total rules applied 25 place count 173 transition count 165
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 168 transition count 165
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 30 place count 168 transition count 150
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 60 place count 153 transition count 150
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 75 place count 138 transition count 135
Iterating global reduction 3 with 15 rules applied. Total rules applied 90 place count 138 transition count 135
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 90 place count 138 transition count 133
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 136 transition count 133
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 180 place count 93 transition count 90
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 93 transition count 90
Applied a total of 192 rules in 61 ms. Remains 93 /183 variables (removed 90) and now considering 90/180 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 93/183 places, 90/180 transitions.
RANDOM walk for 40000 steps (128 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2283398 steps, run timeout after 3001 ms. (steps per millisecond=760 ) properties seen :0 out of 1
Probabilistic random walk after 2283398 steps, saw 424782 distinct states, run finished after 3006 ms. (steps per millisecond=759 ) properties seen :0
// Phase 1: matrix 90 rows 93 cols
[2025-06-04 08:42:42] [INFO ] Computed 28 invariants in 8 ms
[2025-06-04 08:42:42] [INFO ] State equation strengthened by 4 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/70 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/91 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/93 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 90/183 variables, 93/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/70 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/91 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/93 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 90/183 variables, 93/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:43] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:43] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:43] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:43] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:43] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 21 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 93/93 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-04 08:42:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:42:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 08:42:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 08:42:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-04 08:42:43] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 08:42:43] [INFO ] Redundant transitions in 12 ms returned []
Running 89 sub problems to find dead transitions.
[2025-06-04 08:42:43] [INFO ] Invariant cache hit.
[2025-06-04 08:42:43] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/183 variables, 93/136 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 89 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.66868e+08 after 3.69047e+08
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:46] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/183 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:46] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:47] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:47] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:47] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:49] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:49] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:49] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 157 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6406 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/183 variables, 93/152 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 89/245 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:51] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:51] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:54] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:54] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:54] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:54] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:59] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:42:59] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:09] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:09] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:10] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:17] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:17] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.69047e+08 after 5.08824e+08
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:19] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/183 variables, and 272 constraints, problems are : Problem set: 0 solved, 89 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36454ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 36455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36633 ms. Remains : 93/93 places, 90/90 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 300 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 92 /93 variables (removed 1) and now considering 90/90 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 90 rows 92 cols
[2025-06-04 08:43:20] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 08:43:20] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 08:43:20] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2025-06-04 08:43:20] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-04 08:43:20] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
[2025-06-04 08:43:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 240 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 3 ms to minimize.
[2025-06-04 08:43:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
[2025-06-04 08:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
[2025-06-04 08:43:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 08:43:20] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
[2025-06-04 08:43:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
TRAPS : Iteration 5
[2025-06-04 08:43:21] [INFO ] After 907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-04 08:43:21] [INFO ] After 980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-04 08:43:21] [INFO ] Flatten gal took : 9 ms
[2025-06-04 08:43:21] [INFO ] Flatten gal took : 8 ms
[2025-06-04 08:43:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality718411609931331185.gal : 2 ms
[2025-06-04 08:43:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2350641488822782605.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/ReachabilityCardinality718411609931331185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2350641488822782605.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 ...327
Loading property file /tmp/ReachabilityCardinality2350641488822782605.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 202
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :202 after 381
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :381 after 8723
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8723 after 20843
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :20843 after 129565
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :129565 after 702959
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :702959 after 3.53272e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.59044e+08 after 2.64052e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.64052e+08 after 1.16631e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.16631e+09 after 4.23137e+09
Detected timeout of ITS tools.
[2025-06-04 08:43:36] [INFO ] Flatten gal took : 23 ms
[2025-06-04 08:43:36] [INFO ] Applying decomposition
[2025-06-04 08:43:36] [INFO ] Flatten gal took : 7 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/graph11847199530049243048.txt' '-o' '/tmp/graph11847199530049243048.bin' '-w' '/tmp/graph11847199530049243048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11847199530049243048.bin' '-l' '-1' '-v' '-w' '/tmp/graph11847199530049243048.weights' '-q' '0' '-e' '0.001'
[2025-06-04 08:43:36] [INFO ] Decomposing Gal with order
[2025-06-04 08:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 08:43:36] [INFO ] Removed a total of 62 redundant transitions.
[2025-06-04 08:43:36] [INFO ] Flatten gal took : 198 ms
[2025-06-04 08:43:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 10 ms.
[2025-06-04 08:43:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality680405658094824129.gal : 4 ms
[2025-06-04 08:43:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8303868029784591009.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/ReachabilityCardinality680405658094824129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8303868029784591009.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality8303868029784591009.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 19
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :19 after 536
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :536 after 1.91642e+09
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31557 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 08:43:51] [INFO ] Flatten gal took : 9 ms
[2025-06-04 08:43:51] [INFO ] Applying decomposition
[2025-06-04 08:43:51] [INFO ] Flatten gal took : 9 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/graph3981141038462393536.txt' '-o' '/tmp/graph3981141038462393536.bin' '-w' '/tmp/graph3981141038462393536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3981141038462393536.bin' '-l' '-1' '-v' '-w' '/tmp/graph3981141038462393536.weights' '-q' '0' '-e' '0.001'
[2025-06-04 08:43:51] [INFO ] Decomposing Gal with order
[2025-06-04 08:43:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 08:43:51] [INFO ] Removed a total of 69 redundant transitions.
[2025-06-04 08:43:51] [INFO ] Flatten gal took : 16 ms
[2025-06-04 08:43:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-04 08:43:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12464901671336661466.gal : 4 ms
[2025-06-04 08:43:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8509805257362821036.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/ReachabilityCardinality12464901671336661466.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8509805257362821036.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8509805257362821036.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5.8408e+07 after 2.3299e+08
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.3299e+08 after 4.09205e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4.09205e+08 after 2.07637e+10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.07637e+10 after 2.87444e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.68173e+14 after 1.94673e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.82693e+16,62.2638,830608,13020,87,1.06366e+06,774,566,4.28815e+06,60,5328,0
Total reachable state count : 78269256214251495

Verifying 1 reachability properties.
Reachability property ShieldIIPs-PT-003B-ReachabilityFireability-2024-03 does not hold.
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldIIPs-PT-003B-ReachabilityFireability-2024-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPs-PT-003B-ReachabilityFireability-2024-03,0,62.6581,830608,1,0,1.06366e+06,774,603,4.28815e+06,70,5328,14013
All properties solved without resorting to model-checking.
Total runtime 138433 ms.

BK_STOP 1749026694544

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

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