About the Execution of ITS-Tools for ShieldIIPt-PT-030B
| 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 | ?FFTFTTFTTTTFTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532900551.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 ShieldIIPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532900551
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 512K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749148613401
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 18:36:54] [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-05 18:36:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:36:54] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2025-06-05 18:36:54] [INFO ] Transformed 2103 places.
[2025-06-05 18:36:54] [INFO ] Transformed 1953 transitions.
[2025-06-05 18:36:54] [INFO ] Found NUPN structural information;
[2025-06-05 18:36:54] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1580 ms. (25 steps per ms) remains 6/16 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
[2025-06-05 18:36:55] [INFO ] Flatten gal took : 265 ms
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
[2025-06-05 18:36:55] [INFO ] Flatten gal took : 168 ms
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
[2025-06-05 18:36:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13106788357534164965.gal : 64 ms
[2025-06-05 18:36:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15505171966564368412.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/ReachabilityCardinality13106788357534164965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15505171966564368412.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 1953 rows 2103 cols
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2025-06-05 18:36:56] [INFO ] Computed 271 invariants in 36 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality15505171966564368412.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ShieldIIPt-PT-030B-ReachabilityFireability-2025-06 is UNSAT
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1148/1272 variables, 144/268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1272 variables, 1148/1416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1272 variables, 0/1416 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 831/2103 variables, 127/1543 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2103 variables, 831/2374 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2103 variables, 0/2374 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1953/4056 variables, 2103/4477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :36 after 136
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :136 after 671
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :671 after 90101
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :90101 after 2.31482e+09
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2.31482e+09 after 4.68295e+19
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :4.68295e+19 after 5.67854e+39
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :5.67854e+39 after 4.19791e+78
At refinement iteration 10 (OVERLAPS) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4056/4056 variables, and 4477 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2349 ms.
Refiners :[Domain max(s): 2103/2103 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 2103/2103 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1083/1191 variables, 134/242 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1191 variables, 1083/1325 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:36:59] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:36:59] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:36:59] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:36:59] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:36:59] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:36:59] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:00] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:00] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:00] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:00] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:00] [INFO ] Deduced a trap composed of 34 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-05 18:37:00] [INFO ] Deduced a trap composed of 35 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-05 18:37:00] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:01] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 14/1339 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:01] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:01] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:01] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 3/1342 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1191 variables, 0/1342 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 912/2103 variables, 137/1479 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2103 variables, 912/2391 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:02] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:02] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:03] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:03] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:03] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 22 ms to minimize.
SMT process timed out in 7532ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 108 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2103 transition count 1534
Reduce places removed 419 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 421 rules applied. Total rules applied 840 place count 1684 transition count 1532
Reduce places removed 1 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 29 rules applied. Total rules applied 869 place count 1683 transition count 1504
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 897 place count 1655 transition count 1504
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 133 Pre rules applied. Total rules applied 897 place count 1655 transition count 1371
Deduced a syphon composed of 133 places in 7 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 4 with 266 rules applied. Total rules applied 1163 place count 1522 transition count 1371
Discarding 190 places :
Symmetric choice reduction at 4 with 190 rule applications. Total rules 1353 place count 1332 transition count 1181
Iterating global reduction 4 with 190 rules applied. Total rules applied 1543 place count 1332 transition count 1181
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 1543 place count 1332 transition count 1109
Deduced a syphon composed of 72 places in 6 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 1687 place count 1260 transition count 1109
Performed 465 Post agglomeration using F-continuation condition.Transition count delta: 465
Deduced a syphon composed of 465 places in 1 ms
Reduce places removed 465 places and 0 transitions.
Iterating global reduction 4 with 930 rules applied. Total rules applied 2617 place count 795 transition count 644
Renaming transitions due to excessive name length > 1024 char.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 2757 place count 725 transition count 675
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2758 place count 725 transition count 674
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 2761 place count 725 transition count 671
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2764 place count 722 transition count 671
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 6 with 26 rules applied. Total rules applied 2790 place count 722 transition count 671
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2791 place count 721 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2792 place count 720 transition count 670
Applied a total of 2792 rules in 720 ms. Remains 720 /2103 variables (removed 1383) and now considering 670/1953 (removed 1283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 720/2103 places, 670/1953 transitions.
RANDOM walk for 40000 steps (8 resets) in 614 ms. (65 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 167701 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 5
Probabilistic random walk after 167701 steps, saw 89573 distinct states, run finished after 3005 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 670 rows 720 cols
[2025-06-05 18:37:07] [INFO ] Computed 270 invariants in 3 ms
[2025-06-05 18:37:07] [INFO ] State equation strengthened by 146 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/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 325/433 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 228/661 variables, 108/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 621/1282 variables, 661/903 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1282 variables, 144/1047 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1282 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 30/1312 variables, 19/1066 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 9/1075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1312 variables, 2/1077 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1312 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 21/1333 variables, 8/1085 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1333 variables, 4/1089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1333 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 29/1362 variables, 14/1103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1362 variables, 6/1109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1362 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/1363 variables, 1/1110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1363 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1363 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/1365 variables, 1/1112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1365 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 22/1387 variables, 14/1126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1387 variables, 4/1130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1387 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 1/1388 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1388 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1388 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 2/1390 variables, 2/1135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1390 variables, 1/1136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1390 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 0/1390 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1390/1390 variables, and 1136 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 720/720 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 325/433 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:10] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:10] [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-05 18:37:10] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:10] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:10] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:10] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [INFO ] Deduced a trap composed of 12 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-05 18:37:11] [INFO ] Deduced a trap composed of 13 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-05 18:37:11] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 228/661 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [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-05 18:37:11] [INFO ] Deduced a trap composed of 6 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-05 18:37:11] [INFO ] Deduced a trap composed of 7 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-05 18:37:11] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:11] [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-05 18:37:12] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:12] [INFO ] Deduced a trap composed of 8 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-05 18:37:12] [INFO ] Deduced a trap composed of 10 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-05 18:37:12] [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-05 18:37:12] [INFO ] Deduced a trap composed of 8 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-05 18:37:12] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 11/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:12] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 621/1282 variables, 661/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1282 variables, 144/1073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1282 variables, 3/1076 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:13] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:13] [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-05 18:37:13] [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-05 18:37:14] [INFO ] Deduced a trap composed of 9 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-05 18:37:14] [INFO ] Deduced a trap composed of 6 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-05 18:37:14] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:14] [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-05 18:37:14] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1282 variables, 8/1084 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:15] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1282 variables, 1/1085 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:16] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1282 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:16] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:17] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:17] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:17] [INFO ] Deduced a trap along path composed of 3 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-05 18:37:17] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:17] [INFO ] Deduced a trap along path composed of 2 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-05 18:37:17] [INFO ] Deduced a trap along path composed of 4 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-05 18:37:17] [INFO ] Deduced a trap along path composed of 3 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-05 18:37:17] [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-05 18:37:18] [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-05 18:37:18] [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-05 18:37:18] [INFO ] Deduced a trap along path composed of 2 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-05 18:37:18] [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-05 18:37:18] [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-05 18:37:18] [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-05 18:37:20] [INFO ] Deduced a trap along path composed of 4 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-05 18:37:20] [INFO ] Deduced a trap along path composed of 3 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-05 18:37:20] [INFO ] Deduced a trap along path composed of 3 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-05 18:37:21] [INFO ] Deduced a trap along path composed of 2 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-05 18:37:21] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1282 variables, 20/1106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:22] [INFO ] Deduced a trap along path composed of 2 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-05 18:37:23] [INFO ] Deduced a trap along path composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1282 variables, 2/1108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:23] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1282 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1282 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 30/1312 variables, 19/1128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1312 variables, 9/1137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1312 variables, 2/1139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:25] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1312 variables, 1/1140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:26] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1312 variables, 1/1141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1312 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 21/1333 variables, 8/1149 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1333 variables, 4/1153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:28] [INFO ] Deduced a trap along path composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1333 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1333 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 29/1362 variables, 14/1168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1362 variables, 6/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:29] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1362 variables, 1/1175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1362 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 1/1363 variables, 1/1176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1363 variables, 1/1177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1363 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 2/1365 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:32] [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-05 18:37:32] [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-05 18:37:32] [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-05 18:37:32] [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-05 18:37:32] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1365 variables, 5/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1365 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 22/1387 variables, 14/1197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1387 variables, 4/1201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:37:35] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/1387 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1387 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 1/1388 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1388 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1388 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 2/1390 variables, 2/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1390 variables, 1/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1390 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 48 (OVERLAPS) 0/1390 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1390/1390 variables, and 1208 constraints, problems are : Problem set: 0 solved, 5 unsolved in 29820 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 720/720 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 31/31 constraints]
After SMT, in 32430ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3046 ms.
Support contains 108 out of 720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 670/670 transitions.
Applied a total of 0 rules in 72 ms. Remains 720 /720 variables (removed 0) and now considering 670/670 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 720/720 places, 670/670 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 670/670 transitions.
Applied a total of 0 rules in 59 ms. Remains 720 /720 variables (removed 0) and now considering 670/670 (removed 0) transitions.
[2025-06-05 18:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:37:43] [INFO ] Implicit Places using invariants in 455 ms returned []
[2025-06-05 18:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:37:44] [INFO ] State equation strengthened by 146 read => feed constraints.
[2025-06-05 18:37:45] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:37:45] [INFO ] Redundant transitions in 46 ms returned []
Running 662 sub problems to find dead transitions.
[2025-06-05 18:37:45] [INFO ] Invariant cache hit.
[2025-06-05 18:37:45] [INFO ] State equation strengthened by 146 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/715 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/715 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 662 unsolved
At refinement iteration 2 (OVERLAPS) 5/720 variables, 241/270 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:05] [INFO ] Deduced a trap composed of 4 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-05 18:38:05] [INFO ] Deduced a trap composed of 3 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-05 18:38:05] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:05] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:05] [INFO ] Deduced a trap composed of 6 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-05 18:38:05] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 9 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-05 18:38:06] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:06] [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-05 18:38:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:07] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/720 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 662 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:14] [INFO ] Deduced a trap composed of 11 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-05 18:38:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:14] [INFO ] Deduced a trap composed of 7 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-05 18:38:14] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:14] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:14] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:14] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:15] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:15] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:16] [INFO ] Deduced a trap composed of 9 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-05 18:38:16] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 3 ms to minimize.
SMT process timed out in 30302ms, After SMT, problems are : Problem set: 0 solved, 662 unsolved
Search for dead transitions found 0 dead transitions in 30322ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32926 ms. Remains : 720/720 places, 670/670 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1914 edges and 720 vertex of which 719 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 719 transition count 669
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 3 place count 718 transition count 669
Partial Free-agglomeration rule applied 82 times.
Drop transitions (Partial Free agglomeration) removed 82 transitions
Iterating global reduction 0 with 82 rules applied. Total rules applied 85 place count 718 transition count 669
Applied a total of 85 rules in 96 ms. Remains 718 /720 variables (removed 2) and now considering 669/670 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 669 rows 718 cols
[2025-06-05 18:38:16] [INFO ] Computed 269 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 18:38:16] [INFO ] [Real]Absence check using 269 positive place invariants in 67 ms returned sat
[2025-06-05 18:38:16] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 18:38:17] [INFO ] [Nat]Absence check using 269 positive place invariants in 35 ms returned sat
[2025-06-05 18:38:17] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2025-06-05 18:38:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-05 18:38:17] [INFO ] After 319ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:17] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:18] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:18] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:18] [INFO ] Deduced a trap composed of 8 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-05 18:38:18] [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-05 18:38:18] [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-05 18:38:18] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:18] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:19] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 4 ms to minimize.
[2025-06-05 18:38:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1289 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:19] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:19] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 4 ms to minimize.
[2025-06-05 18:38:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:19] [INFO ] Deduced a trap composed of 7 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-05 18:38:19] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:19] [INFO ] Deduced a trap composed of 8 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-05 18:38:19] [INFO ] Deduced a trap composed of 8 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-05 18:38:20] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 5 ms to minimize.
[2025-06-05 18:38:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 623 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:20] [INFO ] Deduced a trap composed of 5 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-05 18:38:20] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:20] [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-05 18:38:20] [INFO ] Deduced a trap composed of 8 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-05 18:38:20] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 3 ms to minimize.
[2025-06-05 18:38:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 597 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:20] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 8 ms to minimize.
[2025-06-05 18:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:21] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 4 ms to minimize.
[2025-06-05 18:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:21] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 4 ms to minimize.
[2025-06-05 18:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:21] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 5 ms to minimize.
[2025-06-05 18:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:21] [INFO ] Deduced a trap composed of 6 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-05 18:38:21] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:38:21] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 3 ms to minimize.
[2025-06-05 18:38:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
TRAPS : Iteration 2
[2025-06-05 18:38:22] [INFO ] After 4835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-05 18:38:22] [INFO ] After 5852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-06-05 18:38:22] [INFO ] Flatten gal took : 83 ms
[2025-06-05 18:38:22] [INFO ] Flatten gal took : 81 ms
[2025-06-05 18:38:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11228738461281293521.gal : 7 ms
[2025-06-05 18:38:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7207104331342394188.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/ReachabilityCardinality11228738461281293521.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7207104331342394188.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/ReachabilityCardinality7207104331342394188.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 123
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :123 after 4323
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :4323 after 3.26592e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3.26592e+06 after 9.1707e+12
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :9.1707e+12 after 7.26891e+15
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :7.26891e+15 after 7.26891e+15
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :7.26891e+15 after 7.26891e+15
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :7.26891e+15 after 7.26891e+15
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :7.26891e+15 after 7.27011e+15
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :7.27011e+15 after 4.36766e+16
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :4.36766e+16 after 1.41092e+23
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :1.41092e+23 after 3.53713e+26
Detected timeout of ITS tools.
[2025-06-05 18:38:37] [INFO ] Flatten gal took : 30 ms
[2025-06-05 18:38:37] [INFO ] Applying decomposition
[2025-06-05 18:38:37] [INFO ] Flatten gal took : 39 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/graph4558119594427803982.txt' '-o' '/tmp/graph4558119594427803982.bin' '-w' '/tmp/graph4558119594427803982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4558119594427803982.bin' '-l' '-1' '-v' '-w' '/tmp/graph4558119594427803982.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:38:38] [INFO ] Decomposing Gal with order
[2025-06-05 18:38:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:38:38] [INFO ] Removed a total of 322 redundant transitions.
[2025-06-05 18:38:38] [INFO ] Flatten gal took : 241 ms
[2025-06-05 18:38:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 84 ms.
[2025-06-05 18:38:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5140296472860901533.gal : 11 ms
[2025-06-05 18:38:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7647353948485283995.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/ReachabilityCardinality5140296472860901533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7647353948485283995.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/ReachabilityCardinality7647353948485283995.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 38
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :38 after 75
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :75 after 149
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :149 after 704
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :704 after 709994
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :709994 after 2.26211e+11
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.26211e+11 after 3.57606e+22
Invariant property ShieldIIPt-PT-030B-ReachabilityFireability-2025-12 does not hold.
Invariant property ShieldIIPt-PT-030B-ReachabilityFireability-2024-11 does not hold.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.57606e+22 after 4.44684e+49
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 37940 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 18:38:54] [INFO ] Flatten gal took : 47 ms
[2025-06-05 18:38:54] [INFO ] Applying decomposition
[2025-06-05 18:38:54] [INFO ] Flatten gal took : 44 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/graph14648881467751182207.txt' '-o' '/tmp/graph14648881467751182207.bin' '-w' '/tmp/graph14648881467751182207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14648881467751182207.bin' '-l' '-1' '-v' '-w' '/tmp/graph14648881467751182207.weights' '-q' '0' '-e' '0.001'
[2025-06-05 18:38:54] [INFO ] Decomposing Gal with order
[2025-06-05 18:38:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 18:38:54] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-05 18:38:54] [INFO ] Flatten gal took : 124 ms
[2025-06-05 18:38:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-05 18:38:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3287098790363773548.gal : 23 ms
[2025-06-05 18:38:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4191639919707429556.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/ReachabilityCardinality3287098790363773548.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4191639919707429556.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/ReachabilityCardinality4191639919707429556.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 3534
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :3534 after 9.8442e+23
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :9.8442e+23 after 1.5006e+90
Reachability property ShieldIIPt-PT-030B-ReachabilityFireability-2025-13 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-030B-ReachabilityFireability-2025-12 does not hold.
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-030B-ReachabilityFireability-2024-11 does not hold.
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.5006e+90 after 8.28054e+105
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.28054e+105 after 4.81156e+106
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.81156e+106 after 8.32546e+107
Detected timeout of ITS tools.
[2025-06-05 19:08:58] [INFO ] Flatten gal took : 289 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10216073386854725048
[2025-06-05 19:08:58] [INFO ] Applying decomposition
[2025-06-05 19:08:58] [INFO ] Computing symmetric may disable matrix : 670 transitions.
[2025-06-05 19:08:58] [INFO ] Flatten gal took : 211 ms
[2025-06-05 19:08:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:08:58] [INFO ] Computing symmetric may enable matrix : 670 transitions.
[2025-06-05 19:08:58] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph18172652940852551804.txt' '-o' '/tmp/graph18172652940852551804.bin' '-w' '/tmp/graph18172652940852551804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18172652940852551804.bin' '-l' '-1' '-v' '-w' '/tmp/graph18172652940852551804.weights' '-q' '0' '-e' '0.001'
[2025-06-05 19:09:01] [INFO ] Computing Do-Not-Accords matrix : 670 transitions.
[2025-06-05 19:09:01] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 19:09:01] [INFO ] Decomposing Gal with order
[2025-06-05 19:09:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 19:09:01] [INFO ] Removed a total of 399 redundant transitions.
[2025-06-05 19:09:01] [INFO ] Flatten gal took : 45 ms
[2025-06-05 19:09:01] [INFO ] Built C files in 2629ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10216073386854725048
[2025-06-05 19:09:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 14 ms.
[2025-06-05 19:09:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10961610605115469321.gal : 9 ms
[2025-06-05 19:09:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15438368219363683263.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/ReachabilityFireability10961610605115469321.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15438368219363683263.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 ...309
Running compilation step : cd /tmp/ltsmin10216073386854725048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityFireability15438368219363683263.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 1185
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1185 after 106635
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106635 after 1.45007e+09
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.78511e+17 after 1.33445e+22
Compilation finished in 1979 ms.
Running link step : cd /tmp/ltsmin10216073386854725048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10216073386854725048;'/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' 'ShieldIIPtPT030BReachabilityFireability202405==true'
Reachability property ShieldIIPt-PT-030B-ReachabilityFireability-2025-14 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.33445e+22 after 2.20746e+47
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.20746e+47 after 1.00336e+49
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin10216073386854725048;'/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' 'ShieldIIPtPT030BReachabilityFireability202405==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin10216073386854725048;'/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' 'ShieldIIPtPT030BReachabilityFireability202405==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.067: Initializing POR dependencies: labels 675, guards 670
pins2lts-mc-linux64( 2/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 8.945: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 9.470: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 9.471: There are 675 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 9.471: State length is 720, there are 670 groups
pins2lts-mc-linux64( 0/ 8), 9.471: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 9.471: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 9.471: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 9.471: Visible groups: 0 / 670, labels: 1 / 675
pins2lts-mc-linux64( 0/ 8), 9.471: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 9.471: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 9.467: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 9.467: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 9.471: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 9.467: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 9.471: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 9.468: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 9.468: "ShieldIIPtPT030BReachabilityFireability202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 9.550: ~71 levels ~960 states ~1424 transitions
pins2lts-mc-linux64( 3/ 8), 9.632: ~5 levels ~1920 states ~6944 transitions
pins2lts-mc-linux64( 3/ 8), 9.746: ~6 levels ~3840 states ~14096 transitions
pins2lts-mc-linux64( 0/ 8), 10.004: ~75 levels ~7680 states ~29072 transitions
pins2lts-mc-linux64( 0/ 8), 10.465: ~77 levels ~15360 states ~62872 transitions
pins2lts-mc-linux64( 6/ 8), 11.438: ~10 levels ~30720 states ~126496 transitions
pins2lts-mc-linux64( 6/ 8), 13.207: ~11 levels ~61440 states ~258120 transitions
pins2lts-mc-linux64( 6/ 8), 16.733: ~12 levels ~122880 states ~566136 transitions
pins2lts-mc-linux64( 6/ 8), 23.243: ~13 levels ~245760 states ~1201688 transitions
pins2lts-mc-linux64( 6/ 8), 37.419: ~14 levels ~491520 states ~2657080 transitions
pins2lts-mc-linux64( 6/ 8), 64.037: ~15 levels ~983040 states ~5512896 transitions
pins2lts-mc-linux64( 6/ 8), 123.831: ~16 levels ~1966080 states ~11986616 transitions
pins2lts-mc-linux64( 6/ 8), 239.470: ~17 levels ~3932160 states ~24795256 transitions
pins2lts-mc-linux64( 6/ 8), 493.239: ~18 levels ~7864320 states ~53017048 transitions
pins2lts-mc-linux64( 5/ 8), 796.988: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 797.121:
pins2lts-mc-linux64( 0/ 8), 797.121: mean standard work distribution: 4.8% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 797.121:
pins2lts-mc-linux64( 0/ 8), 797.121: Explored 11736902 states 87282525 transitions, fanout: 7.437
pins2lts-mc-linux64( 0/ 8), 797.121: Total exploration time 787.640 sec (787.520 sec minimum, 787.558 sec on average)
pins2lts-mc-linux64( 0/ 8), 797.121: States per second: 14901, Transitions per second: 110815
pins2lts-mc-linux64( 0/ 8), 797.121: Ignoring proviso: 7875277
pins2lts-mc-linux64( 0/ 8), 797.121:
pins2lts-mc-linux64( 0/ 8), 797.121: Queue width: 8B, total height: 11626634, memory: 88.70MB
pins2lts-mc-linux64( 0/ 8), 797.121: Tree memory: 434.2MB, 19.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 797.121: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 797.121: Stored 688 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 797.121: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 797.121: Est. total memory use: 523.0MB (~1112.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10216073386854725048;'/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' 'ShieldIIPtPT030BReachabilityFireability202405==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10216073386854725048;'/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' 'ShieldIIPtPT030BReachabilityFireability202405==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)
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="ShieldIIPt-PT-030B"
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 ShieldIIPt-PT-030B, 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-174894532900551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B 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 ;