About the Execution of ITS-Tools for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?TTTFT?TTF?FTT?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533700935.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 ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533700935
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 955K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749339198895
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-07 23:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 23:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 23:33:20] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-06-07 23:33:20] [INFO ] Transformed 3903 places.
[2025-06-07 23:33:20] [INFO ] Transformed 3553 transitions.
[2025-06-07 23:33:20] [INFO ] Found NUPN structural information;
[2025-06-07 23:33:20] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1880 ms. (21 steps per ms) remains 11/16 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
[2025-06-07 23:33:21] [INFO ] Flatten gal took : 415 ms
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
[2025-06-07 23:33:21] [INFO ] Flatten gal took : 252 ms
BEST_FIRST walk for 40004 steps (8 resets) in 718 ms. (55 steps per ms) remains 11/11 properties
[2025-06-07 23:33:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17038673134688480112.gal : 119 ms
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 11/11 properties
[2025-06-07 23:33:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2522317354768437867.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17038673134688480112.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2522317354768437867.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 11/11 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 3553 rows 3903 cols
[2025-06-07 23:33:22] [INFO ] Computed 551 invariants in 42 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality2522317354768437867.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 3620/3789 variables, 532/701 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3789 variables, 3620/4321 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3789 variables, 0/4321 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 114/3903 variables, 19/4340 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3903 variables, 114/4454 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3903/7456 variables, and 4454 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5045 ms.
Refiners :[Domain max(s): 3903/3903 constraints, Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 0/3903 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 3620/3789 variables, 532/701 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3789 variables, 3620/4321 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:29] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:29] [INFO ] Deduced a trap composed of 22 places in 338 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 58
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :58 after 691
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :691 after 17563
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :17563 after 2.501e+08
[2025-06-07 23:33:30] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 33 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2.501e+08 after 4.01557e+14
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :4.01557e+14 after 1.44949e+30
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.44949e+30 after 1.24739e+70
[2025-06-07 23:33:30] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:31] [INFO ] Deduced a trap composed of 24 places in 324 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.24739e+70 after 6.7629e+146
[2025-06-07 23:33:31] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:32] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :6.7629e+146 after 6.7629e+146
[2025-06-07 23:33:32] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 28 ms to minimize.
SMT process timed out in 10399ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 827 transitions
Trivial Post-agglo rules discarded 827 transitions
Performed 827 trivial Post agglomeration. Transition count delta: 827
Iterating post reduction 0 with 827 rules applied. Total rules applied 827 place count 3903 transition count 2726
Reduce places removed 827 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 829 rules applied. Total rules applied 1656 place count 3076 transition count 2724
Reduce places removed 1 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 2 with 39 rules applied. Total rules applied 1695 place count 3075 transition count 2686
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 1733 place count 3037 transition count 2686
Performed 213 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 213 Pre rules applied. Total rules applied 1733 place count 3037 transition count 2473
Deduced a syphon composed of 213 places in 6 ms
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 4 with 426 rules applied. Total rules applied 2159 place count 2824 transition count 2473
Discarding 321 places :
Symmetric choice reduction at 4 with 321 rule applications. Total rules 2480 place count 2503 transition count 2152
Iterating global reduction 4 with 321 rules applied. Total rules applied 2801 place count 2503 transition count 2152
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 124 Pre rules applied. Total rules applied 2801 place count 2503 transition count 2028
Deduced a syphon composed of 124 places in 6 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 3049 place count 2379 transition count 2028
Performed 782 Post agglomeration using F-continuation condition.Transition count delta: 782
Deduced a syphon composed of 782 places in 11 ms
Reduce places removed 782 places and 0 transitions.
Iterating global reduction 4 with 1564 rules applied. Total rules applied 4613 place count 1597 transition count 1246
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4815 place count 1496 transition count 1246
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 23 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 4851 place count 1478 transition count 1246
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 4862 place count 1478 transition count 1235
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 4873 place count 1467 transition count 1235
Partial Free-agglomeration rule applied 136 times.
Drop transitions (Partial Free agglomeration) removed 136 transitions
Iterating global reduction 5 with 136 rules applied. Total rules applied 5009 place count 1467 transition count 1235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5010 place count 1466 transition count 1234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5011 place count 1465 transition count 1234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 5011 place count 1465 transition count 1232
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5015 place count 1463 transition count 1232
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :6.7629e+146 after 6.7629e+146
Applied a total of 5015 rules in 1433 ms. Remains 1463 /3903 variables (removed 2440) and now considering 1232/3553 (removed 2321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 1463/3903 places, 1232/3553 transitions.
RANDOM walk for 40000 steps (8 resets) in 1112 ms. (35 steps per ms) remains 10/11 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 380 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :6.7629e+146 after 6.7629e+146
Interrupted probabilistic random walk after 90677 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 10
Probabilistic random walk after 90677 steps, saw 69501 distinct states, run finished after 3010 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 1232 rows 1463 cols
[2025-06-07 23:33:38] [INFO ] Computed 550 invariants in 7 ms
[2025-06-07 23:33:38] [INFO ] State equation strengthened by 249 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1424 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/1443 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1443 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1218/2661 variables, 1443/1983 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2661 variables, 248/2231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2661 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 10/2671 variables, 6/2237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2671 variables, 3/2240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2671 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 13/2684 variables, 6/2246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2684 variables, 2/2248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :6.7629e+146 after 6.7629e+146
At refinement iteration 13 (INCLUDED_ONLY) 0/2684 variables, 1/2249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2684 variables, 0/2249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/2685 variables, 1/2250 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2685 variables, 1/2251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2685 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1/2686 variables, 1/2252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2686 variables, 1/2253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2686 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 9/2695 variables, 6/2259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2695 variables, 3/2262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2695 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 0/2695 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2695/2695 variables, and 2262 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6877 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1463/1463 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1424 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:45] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:46] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 12 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-07 23:33:47] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:47] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:48] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 11 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-07 23:33:49] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:49] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1424 variables, 18/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:50] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:50] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1424 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:50] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:50] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:51] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:51] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1424 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 19/1443 variables, 8/586 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:52] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:52] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1443 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:52] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:52] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:52] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1443 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 262144
SDD size :6.7629e+146 after 6.7629e+146
At refinement iteration 11 (INCLUDED_ONLY) 0/1443 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1218/2661 variables, 1443/2034 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2661 variables, 248/2282 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2661 variables, 8/2290 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:57] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:57] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:58] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:58] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:58] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:58] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:59] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:59] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:59] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:33:59] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:00] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:00] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:00] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:00] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:00] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:01] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:01] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:01] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2661 variables, 18/2308 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:06] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:07] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:07] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2661 variables, 3/2311 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:10] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:10] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:11] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:12] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:14] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:15] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:15] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:15] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:16] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:16] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:17] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:17] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2661 variables, 12/2323 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 524288
SDD size :6.7629e+146 after 6.7629e+146
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:20] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2661 variables, 1/2324 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:26] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2661 variables, 1/2325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2661/2695 variables, and 2325 constraints, problems are : Problem set: 0 solved, 10 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 540/550 constraints, State Equation: 1443/1463 constraints, ReadFeed: 248/249 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 86/86 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51970ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 1463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1463/1463 places, 1232/1232 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1463 transition count 1232
Applied a total of 1 rules in 208 ms. Remains 1463 /1463 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 1463/1463 places, 1232/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 1297 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 582 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 421 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 448 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 99739 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 10
Probabilistic random walk after 99739 steps, saw 76447 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
// Phase 1: matrix 1232 rows 1463 cols
[2025-06-07 23:34:35] [INFO ] Computed 550 invariants in 4 ms
[2025-06-07 23:34:35] [INFO ] State equation strengthened by 249 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1424 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/1443 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1443 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1218/2661 variables, 1443/1983 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2661 variables, 248/2231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2661 variables, 0/2231 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 10/2671 variables, 6/2237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2671 variables, 3/2240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2671 variables, 0/2240 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 13/2684 variables, 6/2246 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2684 variables, 2/2248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2684 variables, 1/2249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2684 variables, 0/2249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/2685 variables, 1/2250 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2685 variables, 1/2251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2685 variables, 0/2251 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1/2686 variables, 1/2252 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2686 variables, 1/2253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2686 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 9/2695 variables, 6/2259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2695 variables, 3/2262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2695 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 0/2695 variables, 0/2262 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2695/2695 variables, and 2262 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6944 ms.
Refiners :[Positive P Invariants (semi-flows): 550/550 constraints, State Equation: 1463/1463 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1424 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:42] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 9 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-07 23:34:44] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:44] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:45] [INFO ] Deduced a trap composed of 11 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-07 23:34:46] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:46] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:46] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:46] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:46] [INFO ] Deduced a trap composed of 7 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-07 23:34:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1424 variables, 18/570 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:47] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:47] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:47] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1424 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:47] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:47] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:48] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:48] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:48] [INFO ] Deduced a trap composed of 8 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-07 23:34:48] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:48] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1424 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:49] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1424 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:49] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:49] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1424 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1424 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 19/1443 variables, 8/592 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:50] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:50] [INFO ] Deduced a trap composed of 9 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-07 23:34:50] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:51] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1443 variables, 5/597 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:51] [INFO ] Deduced a trap composed of 5 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-07 23:34:51] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:51] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1443 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:51] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:51] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:52] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1443 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1443 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1218/2661 variables, 1443/2046 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2661 variables, 248/2294 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2661 variables, 8/2302 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:55] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:55] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:55] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:55] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:55] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:56] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:56] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:56] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:56] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:57] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:57] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:57] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:58] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:58] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:58] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:58] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:59] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:59] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:59] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:34:59] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 13 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2661 variables, 20/2322 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:01] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:02] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:02] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2661 variables, 3/2325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 1048576
SDD size :6.7629e+146 after 6.7629e+146
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:07] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:08] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:08] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:08] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:08] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:08] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:09] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:09] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:10] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:11] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2661 variables, 11/2336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:13] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2661 variables, 1/2337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:16] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2661 variables, 1/2338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:18] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:18] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:18] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:18] [INFO ] Deduced a trap along path composed of 4 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:19] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:19] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:19] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:19] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:19] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:20] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:21] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:21] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:22] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:22] [INFO ] Deduced a trap along path composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2661 variables, 20/2358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:25] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 6 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2661 variables, 1/2359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:29] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:29] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:29] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2661 variables, 3/2362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2661 variables, 0/2362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (OVERLAPS) 10/2671 variables, 6/2368 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2671 variables, 3/2371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:35:41] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/2671 variables, 1/2372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2671 variables, 0/2372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (OVERLAPS) 13/2684 variables, 6/2378 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2684 variables, 2/2380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2684/2695 variables, and 2381 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75024 ms.
Refiners :[Positive P Invariants (semi-flows): 545/550 constraints, State Equation: 1455/1463 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 10/8 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 24/24 constraints]
After SMT, in 82001ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 1463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1463/1463 places, 1232/1232 transitions.
Applied a total of 0 rules in 66 ms. Remains 1463 /1463 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1463/1463 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1463/1463 places, 1232/1232 transitions.
Applied a total of 0 rules in 40 ms. Remains 1463 /1463 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2025-06-07 23:35:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:35:58] [INFO ] Implicit Places using invariants in 927 ms returned [1446, 1450]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 937 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1461/1463 places, 1232/1232 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1459 transition count 1230
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1459 transition count 1230
Applied a total of 4 rules in 70 ms. Remains 1459 /1461 variables (removed 2) and now considering 1230/1232 (removed 2) transitions.
// Phase 1: matrix 1230 rows 1459 cols
[2025-06-07 23:35:58] [INFO ] Computed 548 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:35:59] [INFO ] Implicit Places using invariants in 840 ms returned []
[2025-06-07 23:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:36:00] [INFO ] State equation strengthened by 247 read => feed constraints.
[2025-06-07 23:36:04] [INFO ] Implicit Places using invariants and state equation in 5303 ms returned []
Implicit Place search using SMT with State Equation took 6157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1459/1463 places, 1230/1232 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7210 ms. Remains : 1459/1463 places, 1230/1232 transitions.
RANDOM walk for 40000 steps (8 resets) in 900 ms. (44 steps per ms) remains 9/10 properties
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 9/9 properties
[2025-06-07 23:36:06] [INFO ] Invariant cache hit.
[2025-06-07 23:36:06] [INFO ] State equation strengthened by 247 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1259/1424 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 19/1443 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1443 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1217/2660 variables, 1443/1983 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2660 variables, 247/2230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2660 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 8/2668 variables, 4/2234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2668 variables, 2/2236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2668 variables, 0/2236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 12/2680 variables, 6/2242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2680 variables, 3/2245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2680 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 9/2689 variables, 6/2251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2689 variables, 3/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2689 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/2689 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2689/2689 variables, and 2254 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4968 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1459/1459 constraints, ReadFeed: 247/247 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1259/1424 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:11] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:11] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:11] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:12] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1424 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:13] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 12 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-07 23:36:14] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:14] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 10 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-07 23:36:15] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1424 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:15] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1424 variables, 6/578 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:16] [INFO ] Deduced a trap composed of 9 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-07 23:36:16] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:17] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 19/1443 variables, 8/590 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:17] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:17] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:18] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:18] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1443 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:18] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:18] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1443 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1443 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1217/2660 variables, 1443/2040 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2660 variables, 247/2287 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2660 variables, 7/2294 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:24] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:24] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:24] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:24] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:25] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:25] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:25] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:25] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:26] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:26] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2660 variables, 10/2304 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:28] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2660 variables, 1/2305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:30] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:30] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:30] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:30] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:30] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:30] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:31] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:31] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:31] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:31] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:31] [INFO ] Deduced a trap along path composed of 2 places in 157 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:31] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:32] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:32] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:32] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:33] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2660 variables, 16/2321 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:35] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2660 variables, 1/2322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:38] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2660 variables, 1/2323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:42] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:42] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:36:42] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 2097152
SDD size :6.7629e+146 after 6.7629e+146
At refinement iteration 19 (INCLUDED_ONLY) 0/2660 variables, 3/2326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2660 variables, 0/2326 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 8/2668 variables, 4/2330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2668 variables, 2/2332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2668 variables, 0/2332 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 12/2680 variables, 6/2338 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2680 variables, 3/2341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2680 variables, 0/2341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 9/2689 variables, 6/2347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2689 variables, 3/2350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2689 variables, 0/2350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 0/2689 variables, 0/2350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2689/2689 variables, and 2350 constraints, problems are : Problem set: 0 solved, 9 unsolved in 53995 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1459/1459 constraints, ReadFeed: 247/247 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 59014ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12594 ms.
Support contains 165 out of 1459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1459/1459 places, 1230/1230 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1457 transition count 1228
Applied a total of 4 rules in 65 ms. Remains 1457 /1459 variables (removed 2) and now considering 1228/1230 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1457/1459 places, 1228/1230 transitions.
RANDOM walk for 40000 steps (8 resets) in 707 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 348 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 428 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 98792 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 9
Probabilistic random walk after 98792 steps, saw 76215 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 1228 rows 1457 cols
[2025-06-07 23:37:22] [INFO ] Computed 548 invariants in 8 ms
[2025-06-07 23:37:22] [INFO ] State equation strengthened by 249 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1422 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1422 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 19/1441 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1441 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1215/2656 variables, 1441/1981 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2656 variables, 249/2230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2656 variables, 0/2230 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 8/2664 variables, 4/2234 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2664 variables, 2/2236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2664 variables, 0/2236 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 12/2676 variables, 6/2242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2676 variables, 3/2245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2676 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 9/2685 variables, 6/2251 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2685 variables, 3/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2685 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/2685 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2685/2685 variables, and 2254 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5582 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1457/1457 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1422 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:28] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:28] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:28] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:28] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:28] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:28] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:29] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 9 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-07 23:37:30] [INFO ] Deduced a trap composed of 6 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-07 23:37:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1422 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:30] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 10 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-07 23:37:31] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:31] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1422 variables, 17/569 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:32] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:32] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:32] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1422 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:32] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:32] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1422 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1422 variables, 5/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:33] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:34] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1422 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:34] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1422 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1422 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 19/1441 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1441 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1215/2656 variables, 1441/2032 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2656 variables, 249/2281 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2656 variables, 7/2288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:37] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:38] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:38] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:38] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:38] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:39] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:39] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:39] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:40] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:40] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:40] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:41] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:41] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:41] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:41] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:41] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:42] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:42] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2656 variables, 18/2306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:44] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:45] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2656 variables, 2/2308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:47] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:47] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:47] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:47] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:47] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:47] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:48] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:49] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2656 variables, 14/2322 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:37:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2656 variables, 1/2323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:38:01] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2656 variables, 1/2324 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2656 variables, 0/2324 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 8/2664 variables, 4/2328 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2664 variables, 2/2330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2664 variables, 0/2330 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 12/2676 variables, 6/2336 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2676 variables, 3/2339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2676 variables, 0/2339 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 9/2685 variables, 6/2345 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2685 variables, 3/2348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2685 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 0/2685 variables, 0/2348 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2685/2685 variables, and 2348 constraints, problems are : Problem set: 0 solved, 9 unsolved in 84362 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1457/1457 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 15/15 constraints]
After SMT, in 89976ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 24612 ms.
Support contains 164 out of 1457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1457/1457 places, 1228/1228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1456 transition count 1227
Applied a total of 2 rules in 73 ms. Remains 1456 /1457 variables (removed 1) and now considering 1227/1228 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1456/1457 places, 1227/1228 transitions.
RANDOM walk for 40000 steps (8 resets) in 578 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 357 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 304 ms. (131 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 96904 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 8
Probabilistic random walk after 96904 steps, saw 74720 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 1227 rows 1456 cols
[2025-06-07 23:39:21] [INFO ] Computed 548 invariants in 4 ms
[2025-06-07 23:39:21] [INFO ] State equation strengthened by 249 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1421 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1421 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 19/1440 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1214/2654 variables, 1440/1980 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2654 variables, 249/2229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2654 variables, 0/2229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 8/2662 variables, 4/2233 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2662 variables, 2/2235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2662 variables, 0/2235 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 12/2674 variables, 6/2241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2674 variables, 3/2244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2674 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 9/2683 variables, 6/2250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2683 variables, 3/2253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2683 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/2683 variables, 0/2253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2683/2683 variables, and 2253 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4558 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1456/1456 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1257/1421 variables, 532/532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:26] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 13 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-07 23:39:27] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:27] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1421 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 10 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-07 23:39:28] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:28] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:29] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:29] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:29] [INFO ] Deduced a trap composed of 9 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-07 23:39:29] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1421 variables, 13/565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:29] [INFO ] Deduced a trap composed of 7 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-07 23:39:29] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:29] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:29] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:30] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:30] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:30] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:30] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:30] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1421 variables, 9/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:30] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1421 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:31] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:31] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:31] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1421 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1421 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 19/1440 variables, 8/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:32] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:32] [INFO ] Deduced a trap composed of 5 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-07 23:39:32] [INFO ] Deduced a trap composed of 7 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-07 23:39:32] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 4/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1440 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1214/2654 variables, 1440/2030 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2654 variables, 249/2279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2654 variables, 6/2285 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:35] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:36] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:36] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:36] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:36] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:37] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:37] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:37] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:37] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:37] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:38] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:38] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:38] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:38] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:39] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:39] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:39] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:39] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:40] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:40] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 9 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2654 variables, 20/2305 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:42] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:42] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:43] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:43] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:44] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2654 variables, 5/2310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:45] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:45] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:45] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 7 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2654 variables, 3/2313 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:48] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:48] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2654 variables, 2/2315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:50] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:50] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:50] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:50] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:50] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:50] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:51] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:51] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:51] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:51] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:52] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:52] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2654 variables, 12/2327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:55] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:39:55] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2654 variables, 2/2329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2654 variables, 0/2329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 8/2662 variables, 4/2333 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2662 variables, 2/2335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2662 variables, 0/2335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 12/2674 variables, 6/2341 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2674 variables, 3/2344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2674 variables, 0/2344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 9/2683 variables, 6/2350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2683 variables, 3/2353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2683 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 0/2683 variables, 0/2353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2683/2683 variables, and 2353 constraints, problems are : Problem set: 0 solved, 8 unsolved in 52391 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1456/1456 constraints, ReadFeed: 249/249 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 14/14 constraints]
After SMT, in 56988ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
SDD proceeding with computation,11 properties remain. new max is 4194304
SDD size :6.7629e+146 after 6.7629e+146
Parikh walk visited 0 properties in 14106 ms.
Support contains 164 out of 1456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 1227/1227 transitions.
Applied a total of 0 rules in 35 ms. Remains 1456 /1456 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1456/1456 places, 1227/1227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 1227/1227 transitions.
Applied a total of 0 rules in 34 ms. Remains 1456 /1456 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
[2025-06-07 23:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:40:32] [INFO ] Implicit Places using invariants in 625 ms returned []
[2025-06-07 23:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 23:40:33] [INFO ] State equation strengthened by 249 read => feed constraints.
[2025-06-07 23:40:37] [INFO ] Implicit Places using invariants and state equation in 5084 ms returned []
Implicit Place search using SMT with State Equation took 5711 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 23:40:38] [INFO ] Redundant transitions in 112 ms returned []
Running 1221 sub problems to find dead transitions.
[2025-06-07 23:40:38] [INFO ] Invariant cache hit.
[2025-06-07 23:40:38] [INFO ] State equation strengthened by 249 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1452/2683 variables, and 6 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/548 constraints, State Equation: 0/1456 constraints, ReadFeed: 0/249 constraints, PredecessorRefiner: 1221/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1221 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/2683 variables, and 6 constraints, problems are : Problem set: 0 solved, 1221 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/548 constraints, State Equation: 0/1456 constraints, ReadFeed: 0/249 constraints, PredecessorRefiner: 0/1221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 1221 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66227 ms. Remains : 1456/1456 places, 1227/1227 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 245 times.
Drop transitions (Partial Free agglomeration) removed 245 transitions
Iterating global reduction 0 with 245 rules applied. Total rules applied 245 place count 1456 transition count 1227
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 247 place count 1456 transition count 1225
Applied a total of 247 rules in 104 ms. Remains 1456 /1456 variables (removed 0) and now considering 1225/1227 (removed 2) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1225 rows 1456 cols
[2025-06-07 23:41:38] [INFO ] Computed 548 invariants in 5 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 23:41:38] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 23:41:39] [INFO ] [Nat]Absence check using 548 positive place invariants in 86 ms returned sat
[2025-06-07 23:41:40] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2025-06-07 23:41:40] [INFO ] State equation strengthened by 204 read => feed constraints.
[2025-06-07 23:41:42] [INFO ] After 1876ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:42] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:42] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:43] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:43] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:43] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:43] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:44] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:44] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:44] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:44] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:45] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:45] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:45] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:45] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:46] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:46] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:46] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:46] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:47] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:47] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:47] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:47] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:48] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 8 ms to minimize.
[2025-06-07 23:41:48] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5587 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:48] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:48] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 8 ms to minimize.
[2025-06-07 23:41:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:51] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:52] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:52] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:52] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 10 ms to minimize.
[2025-06-07 23:41:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1268 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:53] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:53] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:54] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:54] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:54] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 11 ms to minimize.
[2025-06-07 23:41:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1506 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:55] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:55] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:55] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:56] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 11 ms to minimize.
[2025-06-07 23:41:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1201 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:56] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 9 ms to minimize.
[2025-06-07 23:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:56] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 13 ms to minimize.
[2025-06-07 23:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:58] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 10 ms to minimize.
[2025-06-07 23:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:59] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:59] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:41:59] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:00] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:00] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 10 ms to minimize.
[2025-06-07 23:42:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1504 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:00] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:01] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:01] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:01] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 10 ms to minimize.
[2025-06-07 23:42:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1120 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:02] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:02] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:02] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 10 ms to minimize.
[2025-06-07 23:42:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 861 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:03] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 10 ms to minimize.
[2025-06-07 23:42:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:04] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:05] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 9 ms to minimize.
[2025-06-07 23:42:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:06] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:07] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:07] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:08] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:08] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:08] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:09] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:09] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 11 ms to minimize.
[2025-06-07 23:42:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3160 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:10] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:10] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:10] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 10 ms to minimize.
[2025-06-07 23:42:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 893 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:11] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:11] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 10 ms to minimize.
[2025-06-07 23:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 611 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:14] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:14] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:14] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:15] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:15] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:15] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:16] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 9 ms to minimize.
[2025-06-07 23:42:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2402 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:16] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:16] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 8 ms to minimize.
[2025-06-07 23:42:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 501 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:17] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 11 ms to minimize.
[2025-06-07 23:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:17] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 13 ms to minimize.
[2025-06-07 23:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:18] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:18] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 10 ms to minimize.
[2025-06-07 23:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:19] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 9 ms to minimize.
[2025-06-07 23:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:21] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:21] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 9 ms to minimize.
[2025-06-07 23:42:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:22] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:22] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 10 ms to minimize.
[2025-06-07 23:42:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:22] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:23] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:23] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:23] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:24] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:24] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:24] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 16 ms to minimize.
[2025-06-07 23:42:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1991 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:25] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:26] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:26] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:26] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 13 ms to minimize.
[2025-06-07 23:42:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1422 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:27] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 12 ms to minimize.
[2025-06-07 23:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:30] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 9 ms to minimize.
[2025-06-07 23:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 23:42:30] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 11 ms to minimize.
[2025-06-07 23:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
TRAPS : Iteration 6
[2025-06-07 23:42:33] [INFO ] After 53413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2025-06-07 23:42:38] [INFO ] After 60099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2025-06-07 23:42:39] [INFO ] Flatten gal took : 73 ms
[2025-06-07 23:42:39] [INFO ] Flatten gal took : 49 ms
[2025-06-07 23:42:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3993872018782069982.gal : 19 ms
[2025-06-07 23:42:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12811140085599838665.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3993872018782069982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12811140085599838665.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12811140085599838665.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 15
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :15 after 65
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :65 after 5405
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :5405 after 518405
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :518405 after 1.19439e+09
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.19439e+09 after 8.68107e+17
Invariant property ShieldPPPt-PT-050B-ReachabilityFireability-2025-15 does not hold.
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :8.68107e+17 after 8.69204e+17
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :8.69204e+17 after 8.69204e+17
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :8.69204e+17 after 8.69204e+17
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :8.69204e+17 after 8.69204e+17
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :8.69204e+17 after 8.69204e+17
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :8.69204e+17 after 8.70674e+17
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :8.70674e+17 after 8.37804e+19
Detected timeout of ITS tools.
[2025-06-07 23:42:54] [INFO ] Flatten gal took : 44 ms
[2025-06-07 23:42:54] [INFO ] Applying decomposition
[2025-06-07 23:42:54] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4267586382609610436.txt' '-o' '/tmp/graph4267586382609610436.bin' '-w' '/tmp/graph4267586382609610436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4267586382609610436.bin' '-l' '-1' '-v' '-w' '/tmp/graph4267586382609610436.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:42:54] [INFO ] Decomposing Gal with order
[2025-06-07 23:42:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:42:54] [INFO ] Removed a total of 341 redundant transitions.
[2025-06-07 23:42:54] [INFO ] Flatten gal took : 128 ms
[2025-06-07 23:42:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 51 ms.
[2025-06-07 23:42:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8213828157461194516.gal : 21 ms
[2025-06-07 23:42:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16873639488488096316.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/ReachabilityCardinality8213828157461194516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16873639488488096316.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16873639488488096316.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 15
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :15 after 704
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :704 after 4352
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :4352 after 6752
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :6752 after 33376
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :33376 after 1.51123e+06
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1.7832e+08 after 7.31456e+08
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :7.31456e+08 after 2.35638e+23
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 91687 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 23:43:10] [INFO ] Flatten gal took : 75 ms
[2025-06-07 23:43:10] [INFO ] Applying decomposition
[2025-06-07 23:43:10] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14020540397354588579.txt' '-o' '/tmp/graph14020540397354588579.bin' '-w' '/tmp/graph14020540397354588579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14020540397354588579.bin' '-l' '-1' '-v' '-w' '/tmp/graph14020540397354588579.weights' '-q' '0' '-e' '0.001'
[2025-06-07 23:43:10] [INFO ] Decomposing Gal with order
[2025-06-07 23:43:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 23:43:11] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 23:43:11] [INFO ] Flatten gal took : 164 ms
[2025-06-07 23:43:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2025-06-07 23:43:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2695257081514879344.gal : 27 ms
[2025-06-07 23:43:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17271282368336564985.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/ReachabilityCardinality2695257081514879344.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17271282368336564985.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17271282368336564985.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 15954
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :15954 after 3.43046e+51
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :3.43046e+51 after 9.13819e+148
Detected timeout of ITS tools.
[2025-06-08 00:13:15] [INFO ] Flatten gal took : 427 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7215855814000736452
[2025-06-08 00:13:15] [INFO ] Applying decomposition
[2025-06-08 00:13:15] [INFO ] Computing symmetric may disable matrix : 1227 transitions.
[2025-06-08 00:13:15] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:13:15] [INFO ] Computing symmetric may enable matrix : 1227 transitions.
[2025-06-08 00:13:15] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:13:16] [INFO ] Flatten gal took : 310 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9421583347266813198.txt' '-o' '/tmp/graph9421583347266813198.bin' '-w' '/tmp/graph9421583347266813198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9421583347266813198.bin' '-l' '-1' '-v' '-w' '/tmp/graph9421583347266813198.weights' '-q' '0' '-e' '0.001'
[2025-06-08 00:13:17] [INFO ] Decomposing Gal with order
[2025-06-08 00:13:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 00:13:18] [INFO ] Computing Do-Not-Accords matrix : 1227 transitions.
[2025-06-08 00:13:18] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 00:13:18] [INFO ] Built C files in 2637ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7215855814000736452
Running compilation step : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-08 00:13:18] [INFO ] Removed a total of 595 redundant transitions.
[2025-06-08 00:13:18] [INFO ] Flatten gal took : 415 ms
[2025-06-08 00:13:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 117 ms.
[2025-06-08 00:13:19] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6023419876580998110.gal : 40 ms
[2025-06-08 00:13:19] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8628171336289866070.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/ReachabilityFireability6023419876580998110.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8628171336289866070.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability8628171336289866070.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1.46355e+06 after 1.55629e+08
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1.55629e+08 after 1.22215e+10
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1.22215e+10 after 5.77575e+12
Invariant property ShieldPPPt-PT-050B-ReachabilityFireability-2025-11 does not hold.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-2025-07 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-2025-03 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :5.77575e+12 after 1.0612e+72
Compilation finished in 60068 ms.
Running link step : cd /tmp/ltsmin7215855814000736452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202500==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202500==true'
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202506==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202506==true'
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202510==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202510==true'
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202514==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202514==true'
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202515==true'
WARNING : LTSmin timed out (>56 s) on command cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202515==true'
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202500==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202500==true'
Running LTSmin : cd /tmp/ltsmin7215855814000736452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT050BReachabilityFireability202506==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533700935"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;