About the Execution of ITS-Tools for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 188360.00 | 0.00 | 0.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400381.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 FireWire-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400381
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 168K 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748897572989
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 20:52:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 20:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:52:56] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2025-06-02 20:52:56] [INFO ] Transformed 437 places.
[2025-06-02 20:52:56] [INFO ] Transformed 707 transitions.
[2025-06-02 20:52:56] [INFO ] Found NUPN structural information;
[2025-06-02 20:52:56] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 707 rows 437 cols
[2025-06-02 20:52:56] [INFO ] Computed 9 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (3 resets) in 88 ms. (112 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130000 steps (70 resets) in 480 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 20:52:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:52:57] [INFO ] [Real]Absence check using 9 positive place invariants in 33 ms returned sat
[2025-06-02 20:52:58] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:52:58] [INFO ] Deduced a trap composed of 61 places in 544 ms of which 82 ms to minimize.
[2025-06-02 20:52:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:52:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 29 ms returned sat
[2025-06-02 20:52:59] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:00] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:00] [INFO ] Deduced a trap composed of 61 places in 616 ms of which 82 ms to minimize.
[2025-06-02 20:53:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1078 ms
[2025-06-02 20:53:00] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 116 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:04] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2025-06-02 20:53:04] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:04] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 5 ms to minimize.
[2025-06-02 20:53:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-06-02 20:53:05] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:06] [INFO ] Deduced a trap composed of 61 places in 634 ms of which 103 ms to minimize.
[2025-06-02 20:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 735 ms
[2025-06-02 20:53:06] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 100 ms.
[2025-06-02 20:53:10] [INFO ] Added : 155 causal constraints over 31 iterations in 3616 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:10] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2025-06-02 20:53:10] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:11] [INFO ] Deduced a trap composed of 28 places in 569 ms of which 60 ms to minimize.
[2025-06-02 20:53:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-06-02 20:53:12] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:12] [INFO ] Deduced a trap composed of 28 places in 603 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:13] [INFO ] Deduced a trap composed of 107 places in 670 ms of which 140 ms to minimize.
[2025-06-02 20:53:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1415 ms
[2025-06-02 20:53:13] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 111 ms.
[2025-06-02 20:53:16] [INFO ] Added : 150 causal constraints over 30 iterations in 2946 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:16] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:17] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:17] [INFO ] Deduced a trap composed of 28 places in 608 ms of which 60 ms to minimize.
[2025-06-02 20:53:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-06-02 20:53:18] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:19] [INFO ] Deduced a trap composed of 61 places in 649 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:19] [INFO ] Deduced a trap composed of 98 places in 604 ms of which 120 ms to minimize.
[2025-06-02 20:53:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1387 ms
[2025-06-02 20:53:20] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 81 ms.
[2025-06-02 20:53:22] [INFO ] Added : 145 causal constraints over 29 iterations in 2959 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:23] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2025-06-02 20:53:23] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:24] [INFO ] Deduced a trap composed of 28 places in 529 ms of which 57 ms to minimize.
[2025-06-02 20:53:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:24] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:25] [INFO ] Deduced a trap composed of 98 places in 628 ms of which 125 ms to minimize.
[2025-06-02 20:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 726 ms
[2025-06-02 20:53:25] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 85 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:29] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:29] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:30] [INFO ] Deduced a trap composed of 28 places in 595 ms of which 62 ms to minimize.
[2025-06-02 20:53:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 26 ms returned sat
[2025-06-02 20:53:31] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:32] [INFO ] Deduced a trap composed of 64 places in 620 ms of which 106 ms to minimize.
[2025-06-02 20:53:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 707 ms
[2025-06-02 20:53:32] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 77 ms.
[2025-06-02 20:53:35] [INFO ] Added : 200 causal constraints over 40 iterations in 3626 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:35] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:36] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2025-06-02 20:53:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 26 ms returned sat
[2025-06-02 20:53:37] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:37] [INFO ] Deduced a trap composed of 61 places in 553 ms of which 80 ms to minimize.
[2025-06-02 20:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 635 ms
[2025-06-02 20:53:37] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 78 ms.
[2025-06-02 20:53:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:41] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2025-06-02 20:53:42] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2025-06-02 20:53:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:42] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:43] [INFO ] Deduced a trap composed of 64 places in 524 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:43] [INFO ] Deduced a trap composed of 127 places in 587 ms of which 153 ms to minimize.
[2025-06-02 20:53:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1234 ms
[2025-06-02 20:53:44] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:47] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:47] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:48] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 32 ms to minimize.
[2025-06-02 20:53:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-06-02 20:53:48] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:49] [INFO ] Deduced a trap composed of 28 places in 554 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:50] [INFO ] Deduced a trap composed of 61 places in 584 ms of which 91 ms to minimize.
[2025-06-02 20:53:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1254 ms
[2025-06-02 20:53:50] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 73 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:53] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:53:53] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:54] [INFO ] Deduced a trap composed of 28 places in 493 ms of which 54 ms to minimize.
[2025-06-02 20:53:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2025-06-02 20:53:55] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:55] [INFO ] Deduced a trap composed of 67 places in 555 ms of which 101 ms to minimize.
[2025-06-02 20:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 634 ms
[2025-06-02 20:53:55] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 73 ms.
[2025-06-02 20:53:59] [INFO ] Added : 175 causal constraints over 35 iterations in 3722 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:53:59] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:54:00] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:00] [INFO ] Deduced a trap composed of 28 places in 520 ms of which 60 ms to minimize.
[2025-06-02 20:54:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:54:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-06-02 20:54:01] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:02] [INFO ] Deduced a trap composed of 64 places in 530 ms of which 79 ms to minimize.
[2025-06-02 20:54:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 612 ms
[2025-06-02 20:54:02] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 69 ms.
[2025-06-02 20:54:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:54:06] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:54:06] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:07] [INFO ] Deduced a trap composed of 28 places in 531 ms of which 57 ms to minimize.
[2025-06-02 20:54:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:54:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2025-06-02 20:54:07] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:08] [INFO ] Deduced a trap composed of 64 places in 533 ms of which 76 ms to minimize.
[2025-06-02 20:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 616 ms
[2025-06-02 20:54:08] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 72 ms.
[2025-06-02 20:54:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:54:12] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-06-02 20:54:12] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:13] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 7 ms to minimize.
[2025-06-02 20:54:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 20:54:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 26 ms returned sat
[2025-06-02 20:54:13] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:14] [INFO ] Deduced a trap composed of 61 places in 520 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:14] [INFO ] Deduced a trap composed of 64 places in 581 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:15] [INFO ] Deduced a trap composed of 127 places in 647 ms of which 140 ms to minimize.
[2025-06-02 20:54:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1904 ms
[2025-06-02 20:54:15] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 70 ms.
[2025-06-02 20:54:18] [INFO ] Added : 105 causal constraints over 21 iterations in 2454 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 311 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 418 transition count 613
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 164 place count 339 transition count 611
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 167 place count 338 transition count 609
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 336 transition count 609
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 169 place count 336 transition count 599
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 189 place count 326 transition count 599
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 248 place count 267 transition count 537
Iterating global reduction 4 with 59 rules applied. Total rules applied 307 place count 267 transition count 537
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 309 place count 267 transition count 535
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 309 place count 267 transition count 531
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 263 transition count 531
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 335 place count 245 transition count 451
Iterating global reduction 5 with 18 rules applied. Total rules applied 353 place count 245 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 355 place count 245 transition count 449
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 359 place count 241 transition count 442
Iterating global reduction 6 with 4 rules applied. Total rules applied 363 place count 241 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 365 place count 241 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 366 place count 240 transition count 440
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 367 place count 239 transition count 437
Iterating global reduction 8 with 1 rules applied. Total rules applied 368 place count 239 transition count 437
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 369 place count 238 transition count 435
Iterating global reduction 8 with 1 rules applied. Total rules applied 370 place count 238 transition count 435
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 371 place count 237 transition count 432
Iterating global reduction 8 with 1 rules applied. Total rules applied 372 place count 237 transition count 432
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 373 place count 236 transition count 430
Iterating global reduction 8 with 1 rules applied. Total rules applied 374 place count 236 transition count 430
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 375 place count 235 transition count 427
Iterating global reduction 8 with 1 rules applied. Total rules applied 376 place count 235 transition count 427
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 377 place count 234 transition count 425
Iterating global reduction 8 with 1 rules applied. Total rules applied 378 place count 234 transition count 425
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 379 place count 233 transition count 422
Iterating global reduction 8 with 1 rules applied. Total rules applied 380 place count 233 transition count 422
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 381 place count 232 transition count 420
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 232 transition count 420
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 383 place count 231 transition count 417
Iterating global reduction 8 with 1 rules applied. Total rules applied 384 place count 231 transition count 417
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 385 place count 230 transition count 415
Iterating global reduction 8 with 1 rules applied. Total rules applied 386 place count 230 transition count 415
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 387 place count 229 transition count 413
Iterating global reduction 8 with 1 rules applied. Total rules applied 388 place count 229 transition count 413
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 389 place count 228 transition count 411
Iterating global reduction 8 with 1 rules applied. Total rules applied 390 place count 228 transition count 411
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 462 place count 192 transition count 375
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 518 place count 164 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 519 place count 164 transition count 435
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 538 place count 164 transition count 416
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 562 place count 145 transition count 411
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 566 place count 141 transition count 407
Iterating global reduction 9 with 4 rules applied. Total rules applied 570 place count 141 transition count 407
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 576 place count 141 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 595 place count 141 transition count 382
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 597 place count 141 transition count 382
Applied a total of 597 rules in 370 ms. Remains 141 /437 variables (removed 296) and now considering 382/707 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 141/437 places, 382/707 transitions.
[2025-06-02 20:54:20] [INFO ] Flow matrix only has 377 transitions (discarded 5 similar events)
// Phase 1: matrix 377 rows 141 cols
[2025-06-02 20:54:20] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (49075 resets) in 2600 ms. (384 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (61417 resets) in 3131 ms. (1596 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-02 20:54:26] [INFO ] Flow matrix only has 377 transitions (discarded 5 similar events)
[2025-06-02 20:54:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:26] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 20:54:26] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2025-06-02 20:54:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:26] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2025-06-02 20:54:26] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-02 20:54:26] [INFO ] [Nat]Added 64 Read/Feed constraints in 60 ms returned sat
[2025-06-02 20:54:26] [INFO ] Computed and/alt/rep : 150/732/150 causal constraints (skipped 223 transitions) in 48 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:27] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:27] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:28] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:28] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:28] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 18 ms to minimize.
[2025-06-02 20:54:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1295 ms
[2025-06-02 20:54:28] [INFO ] Added : 43 causal constraints over 10 iterations in 1854 ms. Result :sat
Minimization took 492 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:29] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:29] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 20:54:29] [INFO ] [Real]Added 64 Read/Feed constraints in 50 ms returned sat
[2025-06-02 20:54:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:29] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-06-02 20:54:29] [INFO ] [Nat]Added 64 Read/Feed constraints in 84 ms returned sat
[2025-06-02 20:54:30] [INFO ] Computed and/alt/rep : 150/732/150 causal constraints (skipped 223 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:30] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 26 ms to minimize.
[2025-06-02 20:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2025-06-02 20:54:30] [INFO ] Added : 15 causal constraints over 4 iterations in 568 ms. Result :sat
Minimization took 377 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:31] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:31] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-06-02 20:54:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:31] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-06-02 20:54:31] [INFO ] [Nat]Added 64 Read/Feed constraints in 84 ms returned sat
[2025-06-02 20:54:31] [INFO ] Computed and/alt/rep : 150/732/150 causal constraints (skipped 223 transitions) in 48 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:32] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 22 ms to minimize.
[2025-06-02 20:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2025-06-02 20:54:32] [INFO ] Added : 46 causal constraints over 10 iterations in 810 ms. Result :sat
Minimization took 438 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:32] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:33] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-06-02 20:54:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:33] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-06-02 20:54:33] [INFO ] [Nat]Added 64 Read/Feed constraints in 56 ms returned sat
[2025-06-02 20:54:33] [INFO ] Computed and/alt/rep : 150/732/150 causal constraints (skipped 223 transitions) in 48 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:34] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:34] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 5 ms to minimize.
[2025-06-02 20:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2025-06-02 20:54:34] [INFO ] Added : 19 causal constraints over 7 iterations in 990 ms. Result :sat
Minimization took 396 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:34] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:35] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-06-02 20:54:35] [INFO ] [Real]Added 64 Read/Feed constraints in 46 ms returned sat
[2025-06-02 20:54:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:35] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-02 20:54:35] [INFO ] [Nat]Added 64 Read/Feed constraints in 54 ms returned sat
[2025-06-02 20:54:35] [INFO ] Computed and/alt/rep : 150/732/150 causal constraints (skipped 223 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:36] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:36] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:36] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 3 ms to minimize.
[2025-06-02 20:54:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2025-06-02 20:54:36] [INFO ] Added : 36 causal constraints over 8 iterations in 969 ms. Result :sat
Minimization took 406 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 382/382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 141 transition count 379
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 138 transition count 379
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 137 transition count 377
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 137 transition count 377
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 136 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 136 transition count 374
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 136 transition count 371
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 17 place count 134 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 133 transition count 370
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 133 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 25 place count 133 transition count 364
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 133 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 133 transition count 363
Applied a total of 27 rules in 78 ms. Remains 133 /141 variables (removed 8) and now considering 363/382 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 133/141 places, 363/382 transitions.
[2025-06-02 20:54:37] [INFO ] Flow matrix only has 358 transitions (discarded 5 similar events)
// Phase 1: matrix 358 rows 133 cols
[2025-06-02 20:54:37] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (49251 resets) in 2038 ms. (490 steps per ms)
BEST_FIRST walk for 5000004 steps (61686 resets) in 2999 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-02 20:54:42] [INFO ] Flow matrix only has 358 transitions (discarded 5 similar events)
[2025-06-02 20:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:42] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 20:54:42] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-02 20:54:42] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-02 20:54:42] [INFO ] [Real]Added 61 Read/Feed constraints in 28 ms returned sat
[2025-06-02 20:54:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 20:54:42] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-06-02 20:54:42] [INFO ] [Nat]Added 61 Read/Feed constraints in 41 ms returned sat
[2025-06-02 20:54:42] [INFO ] Computed and/alt/rep : 157/848/157 causal constraints (skipped 197 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 4 ms to minimize.
[2025-06-02 20:54:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 529 ms
[2025-06-02 20:54:43] [INFO ] Added : 66 causal constraints over 14 iterations in 1230 ms. Result :sat
Minimization took 370 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:44] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:44] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-02 20:54:44] [INFO ] [Real]Added 61 Read/Feed constraints in 46 ms returned sat
[2025-06-02 20:54:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:44] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2025-06-02 20:54:44] [INFO ] [Nat]Added 61 Read/Feed constraints in 86 ms returned sat
[2025-06-02 20:54:44] [INFO ] Computed and/alt/rep : 157/848/157 causal constraints (skipped 197 transitions) in 42 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:45] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:45] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:46] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 25 ms to minimize.
[2025-06-02 20:54:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 804 ms
[2025-06-02 20:54:46] [INFO ] Added : 29 causal constraints over 9 iterations in 1363 ms. Result :sat
Minimization took 303 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:46] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:46] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-06-02 20:54:46] [INFO ] [Real]Added 61 Read/Feed constraints in 53 ms returned sat
[2025-06-02 20:54:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:47] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2025-06-02 20:54:47] [INFO ] [Nat]Added 61 Read/Feed constraints in 61 ms returned sat
[2025-06-02 20:54:47] [INFO ] Computed and/alt/rep : 157/848/157 causal constraints (skipped 197 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:47] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 6 ms to minimize.
[2025-06-02 20:54:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2025-06-02 20:54:47] [INFO ] Added : 41 causal constraints over 9 iterations in 595 ms. Result :sat
Minimization took 323 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:48] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:48] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 20:54:48] [INFO ] [Real]Added 61 Read/Feed constraints in 47 ms returned sat
[2025-06-02 20:54:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-02 20:54:48] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-02 20:54:48] [INFO ] [Nat]Added 61 Read/Feed constraints in 80 ms returned sat
[2025-06-02 20:54:48] [INFO ] Computed and/alt/rep : 157/848/157 causal constraints (skipped 197 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:49] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:49] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 6 ms to minimize.
[2025-06-02 20:54:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 447 ms
[2025-06-02 20:54:49] [INFO ] Added : 38 causal constraints over 9 iterations in 940 ms. Result :sat
Minimization took 318 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:50] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:50] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-02 20:54:50] [INFO ] [Real]Added 61 Read/Feed constraints in 51 ms returned sat
[2025-06-02 20:54:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 20:54:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-02 20:54:50] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-06-02 20:54:50] [INFO ] [Nat]Added 61 Read/Feed constraints in 68 ms returned sat
[2025-06-02 20:54:50] [INFO ] Computed and/alt/rep : 157/848/157 causal constraints (skipped 197 transitions) in 40 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:50] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 4 ms to minimize.
[2025-06-02 20:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-02 20:54:51] [INFO ] Added : 24 causal constraints over 5 iterations in 402 ms. Result :sat
Minimization took 307 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 363/363 transitions.
Applied a total of 0 rules in 19 ms. Remains 133 /133 variables (removed 0) and now considering 363/363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 133/133 places, 363/363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 363/363 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 363/363 (removed 0) transitions.
[2025-06-02 20:54:51] [INFO ] Flow matrix only has 358 transitions (discarded 5 similar events)
[2025-06-02 20:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:54:51] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-02 20:54:51] [INFO ] Flow matrix only has 358 transitions (discarded 5 similar events)
[2025-06-02 20:54:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:54:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-02 20:54:52] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:54:52] [INFO ] Redundant transitions in 30 ms returned []
Running 359 sub problems to find dead transitions.
[2025-06-02 20:54:52] [INFO ] Flow matrix only has 358 transitions (discarded 5 similar events)
[2025-06-02 20:54:52] [INFO ] Invariant cache hit.
[2025-06-02 20:54:52] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:58] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:59] [INFO ] Deduced a trap composed of 35 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-02 20:54:59] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:59] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:00] [INFO ] Deduced a trap composed of 99 places in 187 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 358/491 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 61/210 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 359 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 210 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (OVERLAPS) 358/491 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 61/210 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 359/569 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:43] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 570 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60499ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61289 ms. Remains : 133/133 places, 363/363 transitions.
RANDOM walk for 40000 steps (1984 resets) in 2368 ms. (16 steps per ms) remains 10/10 properties
[2025-06-02 20:55:53] [INFO ] Flatten gal took : 244 ms
BEST_FIRST walk for 40004 steps (498 resets) in 432 ms. (92 steps per ms) remains 10/10 properties
[2025-06-02 20:55:53] [INFO ] Flatten gal took : 150 ms
BEST_FIRST walk for 40003 steps (485 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (487 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (491 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
[2025-06-02 20:55:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6870230286427449281.gal : 46 ms
BEST_FIRST walk for 40003 steps (501 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
[2025-06-02 20:55:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12934517737281718441.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/ReachabilityCardinality6870230286427449281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12934517737281718441.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
BEST_FIRST walk for 40003 steps (481 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (491 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality12934517737281718441.prop.
BEST_FIRST walk for 40003 steps (501 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (492 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :10 after 11
BEST_FIRST walk for 40004 steps (492 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :11 after 99
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :99 after 219
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :219 after 673
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :673 after 1463
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1463 after 2733
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2733 after 7071
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :7071 after 31801
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :31801 after 79382
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :79382 after 6.90378e+06
Interrupted probabilistic random walk after 388605 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :4 out of 10
Probabilistic random walk after 388605 steps, saw 99178 distinct states, run finished after 3014 ms. (steps per millisecond=128 ) properties seen :4
[2025-06-02 20:55:57] [INFO ] Flow matrix only has 358 transitions (discarded 5 similar events)
[2025-06-02 20:55:57] [INFO ] Invariant cache hit.
[2025-06-02 20:55:57] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:57] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:57] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 358/483 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 61/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/491 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/491 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 55/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 69/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:58] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 358/483 variables, 125/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 61/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/491 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/491 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 363/363 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 361
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 130 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 357
Applied a total of 8 rules in 18 ms. Remains 129 /133 variables (removed 4) and now considering 357/363 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 129/133 places, 357/363 transitions.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
RANDOM walk for 40000 steps (1947 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (507 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (474 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
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,7.58782e+06,4.94224,101568,2,9247,23,212146,6,0,897,322780,0
Total reachable state count : 7587815
Verifying 10 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1177,4.94505,101568,2,816,23,212146,7,0,900,322780,0
Invariant property MIN0 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
MIN0,1177,4.94685,101568,2,816,23,212146,8,0,901,322780,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,9,4.94744,101568,2,144,23,212146,9,0,903,322780,0
Invariant property MIN1 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
MIN1,9,4.94787,101568,2,144,23,212146,10,0,904,322780,0
Reachability property MAX2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,11075,4.94869,101568,2,1490,23,212146,11,0,906,322780,0
Invariant property MIN2 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
MIN2,11075,4.94954,101568,2,1490,23,212146,12,0,907,322780,0
Reachability property MAX3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,11075,4.95038,101568,2,1490,23,212146,13,0,909,322780,0
Invariant property MIN3 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
MIN3,11075,4.95118,101568,2,1490,23,212146,14,0,910,322780,0
Reachability property MAX4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,3,4.95189,101568,2,136,23,212146,15,0,912,322780,0
Invariant property MIN4 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
MIN4,3,4.95247,101568,2,136,23,212146,16,0,913,322780,0
Finished probabilistic random walk after 513976 steps, run visited all 2 properties in 2261 ms. (steps per millisecond=227 )
Probabilistic random walk after 513976 steps, saw 131031 distinct states, run finished after 2266 ms. (steps per millisecond=226 ) properties seen :2
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 185710 ms.
BK_STOP 1748897761349
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="FireWire-PT-18"
export BK_EXAMINATION="UpperBounds"
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 FireWire-PT-18, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102400381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;