Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533600886.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ShieldPPPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533600886
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K 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 99K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 376K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749308058171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-07 14:54:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 14:54:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 14:54:19] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-06-07 14:54:19] [INFO ] Transformed 1563 places.
[2025-06-07 14:54:19] [INFO ] Transformed 1423 transitions.
[2025-06-07 14:54:19] [INFO ] Found NUPN structural information;
[2025-06-07 14:54:19] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1497 ms. (26 steps per ms) remains 4/13 properties
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 4/4 properties
[2025-06-07 14:54:20] [INFO ] Flatten gal took : 271 ms
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
[2025-06-07 14:54:20] [INFO ] Flatten gal took : 153 ms
// Phase 1: matrix 1423 rows 1563 cols
[2025-06-07 14:54:20] [INFO ] Computed 221 invariants in 28 ms
[2025-06-07 14:54:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16260631500253892854.gal : 78 ms
[2025-06-07 14:54:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7836597734173199081.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/ReachabilityCardinality16260631500253892854.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7836597734173199081.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
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality7836597734173199081.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 468/500 variables, 53/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 468/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1563 variables, 168/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1563 variables, 1063/1784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1563 variables, 0/1784 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 28
At refinement iteration 8 (OVERLAPS) 1423/2986 variables, 1563/3347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :28 after 44
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :44 after 853
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :853 after 534613
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :534613 after 1.15741e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.15741e+09 after 2.52579e+17
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.52579e+17 after 1.34158e+32
At refinement iteration 9 (INCLUDED_ONLY) 0/2986 variables, 0/3347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2986 variables, 0/3347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
Reachability property ShieldPPPt-PT-020B-ReachabilityCardinality-2025-12 is true.
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
After SMT solving in domain Real declared 2986/2986 variables, and 3347 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1547 ms.
Refiners :[Domain max(s): 1563/1563 constraints, Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1563/1563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Invariant property ShieldPPPt-PT-020B-ReachabilityCardinality-2025-03 does not hold.
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.34158e+32 after 5.89927e+58
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 468/500 variables, 53/85 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 468/553 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.89927e+58 after 5.89927e+58
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:22] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:22] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 2/555 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.89927e+58 after 5.89927e+58
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/555 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1563 variables, 168/723 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1563 variables, 1063/1786 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:23] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:23] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 28 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.89927e+58 after 5.89927e+58
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:23] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:23] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:24] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:24] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:24] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 23 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :5.89927e+58 after 5.89927e+58
[2025-06-07 14:54:24] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:25] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:25] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:25] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:25] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:25] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:26] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:26] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:26] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:26] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:26] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:26] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:27] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1563 variables, 20/1806 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:27] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 16 ms to minimize.
SMT process timed out in 6678ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 376 transitions
Trivial Post-agglo rules discarded 376 transitions
Performed 376 trivial Post agglomeration. Transition count delta: 376
Iterating post reduction 0 with 376 rules applied. Total rules applied 376 place count 1563 transition count 1047
Reduce places removed 376 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 378 rules applied. Total rules applied 754 place count 1187 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 755 place count 1186 transition count 1045
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 755 place count 1186 transition count 964
Deduced a syphon composed of 81 places in 4 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 917 place count 1105 transition count 964
Discarding 132 places :
Symmetric choice reduction at 3 with 132 rule applications. Total rules 1049 place count 973 transition count 832
Iterating global reduction 3 with 132 rules applied. Total rules applied 1181 place count 973 transition count 832
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1181 place count 973 transition count 776
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1293 place count 917 transition count 776
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1969 place count 579 transition count 438
Renaming transitions due to excessive name length > 1024 char.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2081 place count 523 transition count 438
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2083 place count 523 transition count 436
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2085 place count 521 transition count 436
Partial Free-agglomeration rule applied 58 times.
Drop transitions (Partial Free agglomeration) removed 58 transitions
Iterating global reduction 4 with 58 rules applied. Total rules applied 2143 place count 521 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2144 place count 520 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2145 place count 519 transition count 435
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2145 place count 519 transition count 433
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2149 place count 517 transition count 433
Applied a total of 2149 rules in 536 ms. Remains 517 /1563 variables (removed 1046) and now considering 433/1423 (removed 990) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 517/1563 places, 433/1423 transitions.
RANDOM walk for 40000 steps (8 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5.89927e+58 after 5.89927e+58
Interrupted probabilistic random walk after 241312 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 241312 steps, saw 161520 distinct states, run finished after 3006 ms. (steps per millisecond=80 ) properties seen :0
// Phase 1: matrix 433 rows 517 cols
[2025-06-07 14:54:31] [INFO ] Computed 220 invariants in 2 ms
[2025-06-07 14:54:31] [INFO ] State equation strengthened by 10 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/83 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/192 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 199/391 variables, 106/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 32/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/406 variables, 16/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 15/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 27/433 variables, 14/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 168/601 variables, 102/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/601 variables, 32/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/601 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/601 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 5/606 variables, 5/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 10/616 variables, 5/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/616 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 184/800 variables, 110/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/800 variables, 37/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/800 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 8/808 variables, 10/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/808 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/808 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 12/820 variables, 6/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/820 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 67/887 variables, 49/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/887 variables, 15/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/887 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 1/888 variables, 2/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/888 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/888 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 29/917 variables, 16/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/917 variables, 6/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/917 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 2/919 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/919 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/919 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 4/923 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/923 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 19/942 variables, 13/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/942 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/942 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 8/950 variables, 6/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/950 variables, 3/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/950 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 0/950 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 950/950 variables, and 747 constraints, problems are : Problem set: 0 solved, 2 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 517/517 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/83 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/192 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 199/391 variables, 106/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 32/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 5 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-07 14:54:32] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 5 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-07 14:54:32] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/391 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 15/406 variables, 16/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 15/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/406 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 27/433 variables, 14/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/433 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 168/601 variables, 102/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/601 variables, 32/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/601 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/601 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 5/606 variables, 5/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/606 variables, 5/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/606 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 10/616 variables, 5/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:32] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:33] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/616 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/616 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 184/800 variables, 110/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/800 variables, 37/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/800 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 8/808 variables, 10/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/808 variables, 8/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:33] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 3 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/808 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/808 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 12/820 variables, 6/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/820 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 67/887 variables, 49/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/887 variables, 15/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/887 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 1/888 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/888 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:33] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 3 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/888 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/888 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 29/917 variables, 16/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/917 variables, 6/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:33] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 131072
[2025-06-07 14:54:34] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
SDD size :5.89927e+58 after 5.89927e+58
At refinement iteration 50 (INCLUDED_ONLY) 0/917 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/917 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/919 variables, 2/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/919 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/919 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 4/923 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/923 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 19/942 variables, 13/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/942 variables, 4/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 8/950 variables, 6/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/950 variables, 3/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/950 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 0/950 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 950/950 variables, and 763 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3104 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 517/517 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 3738ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 515 ms.
Support contains 16 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 433/433 transitions.
Applied a total of 0 rules in 52 ms. Remains 517 /517 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 517/517 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 433/433 transitions.
Applied a total of 0 rules in 18 ms. Remains 517 /517 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2025-06-07 14:54:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:54:35] [INFO ] Implicit Places using invariants in 389 ms returned [499, 503]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 398 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 515/517 places, 433/433 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 513 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 513 transition count 431
Applied a total of 4 rules in 24 ms. Remains 513 /515 variables (removed 2) and now considering 431/433 (removed 2) transitions.
// Phase 1: matrix 431 rows 513 cols
[2025-06-07 14:54:35] [INFO ] Computed 218 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:54:36] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-07 14:54:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:54:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-07 14:54:36] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 513/517 places, 431/433 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1214 ms. Remains : 513/517 places, 431/433 transitions.
RANDOM walk for 40000 steps (8 resets) in 377 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 229217 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 229217 steps, saw 156377 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2025-06-07 14:54:39] [INFO ] Invariant cache hit.
[2025-06-07 14:54:39] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/83 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/192 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 198/390 variables, 106/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 33/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/404 variables, 15/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 14/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 26/430 variables, 13/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 167/597 variables, 102/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/597 variables, 32/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/597 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 5/602 variables, 5/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/602 variables, 5/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 10/612 variables, 5/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/612 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 182/794 variables, 108/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/794 variables, 36/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/794 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 8/802 variables, 10/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/802 variables, 8/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/802 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 12/814 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/814 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 67/881 variables, 49/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/881 variables, 15/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/881 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 1/882 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/882 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/882 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 29/911 variables, 16/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/911 variables, 6/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/911 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 2/913 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/913 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/913 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 4/917 variables, 2/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/917 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 19/936 variables, 13/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/936 variables, 4/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/936 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 8/944 variables, 6/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/944 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/944 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 0/944 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 944/944 variables, and 739 constraints, problems are : Problem set: 0 solved, 2 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 513/513 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/83 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/192 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 7/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 198/390 variables, 106/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 33/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:40] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:40] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:40] [INFO ] Deduced a trap composed of 4 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-07 14:54:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/404 variables, 15/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 14/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/404 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 26/430 variables, 13/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/430 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 167/597 variables, 102/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/597 variables, 32/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:41] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/597 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/597 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 5/602 variables, 5/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/602 variables, 5/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/602 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 10/612 variables, 5/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/612 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 182/794 variables, 108/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/794 variables, 36/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:41] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:41] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/794 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:41] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:41] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 4 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/794 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/794 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 8/802 variables, 10/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/802 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:41] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/802 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/802 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 12/814 variables, 6/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/814 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 67/881 variables, 49/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/881 variables, 15/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/881 variables, 4/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/881 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/881 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 1/882 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/882 variables, 1/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/882 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 29/911 variables, 16/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/911 variables, 6/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:42] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:43] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:43] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:43] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:43] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:43] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:43] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/911 variables, 8/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/911 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/913 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/913 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/913 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 4/917 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/917 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 19/936 variables, 13/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/936 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/936 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 8/944 variables, 6/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/944 variables, 3/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/944 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 0/944 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 944/944 variables, and 767 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 513/513 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 17/17 constraints]
After SMT, in 4012ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 607 ms.
Support contains 16 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 19 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 513/513 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2025-06-07 14:54:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:54:44] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-07 14:54:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:54:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-07 14:54:45] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:54:45] [INFO ] Redundant transitions in 22 ms returned []
Running 424 sub problems to find dead transitions.
[2025-06-07 14:54:45] [INFO ] Invariant cache hit.
[2025-06-07 14:54:45] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.89927e+58 after 5.89927e+58
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:48] [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-07 14:54:48] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [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-07 14:54:49] [INFO ] Deduced a trap composed of 5 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-07 14:54:49] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 5 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-07 14:54:49] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 5 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-07 14:54:49] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 5 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-07 14:54:49] [INFO ] Deduced a trap composed of 5 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-07 14:54:49] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:49] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:50] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:50] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:50] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:50] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:51] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:52] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:53] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:53] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:54] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:54] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:54:55] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 424 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :5.89927e+58 after 5.89927e+58
At refinement iteration 6 (OVERLAPS) 5/513 variables, 19/262 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/944 variables, and 263 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 0/513 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 45/244 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 5/513 variables, 19/263 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:22] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (OVERLAPS) 431/944 variables, 513/777 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/944 variables, 8/785 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/944 variables, 424/1209 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:33] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:34] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:35] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:36] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 6/1215 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:44] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 944/944 variables, and 1216 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 513/513 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60924 ms. Remains : 513/513 places, 431/431 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 108 times.
Drop transitions (Partial Free agglomeration) removed 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 108 place count 513 transition count 431
Applied a total of 108 rules in 39 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 431 rows 513 cols
[2025-06-07 14:55:45] [INFO ] Computed 218 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 14:55:45] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 14:55:45] [INFO ] [Nat]Absence check using 218 positive place invariants in 36 ms returned sat
[2025-06-07 14:55:45] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-07 14:55:45] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-07 14:55:46] [INFO ] After 106ms SMT Verify possible using 104 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:46] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 15 ms to minimize.
[2025-06-07 14:55:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:46] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:46] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:46] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 5 ms to minimize.
[2025-06-07 14:55:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:46] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [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-07 14:55:47] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 4 ms to minimize.
[2025-06-07 14:55:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 992 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:47] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 3 ms to minimize.
[2025-06-07 14:55:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 14:55:48] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 4 ms to minimize.
[2025-06-07 14:55:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
TRAPS : Iteration 4
[2025-06-07 14:55:48] [INFO ] After 2282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-07 14:55:48] [INFO ] After 2681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-07 14:55:48] [INFO ] Flatten gal took : 40 ms
[2025-06-07 14:55:48] [INFO ] Flatten gal took : 25 ms
[2025-06-07 14:55:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8230399702486666419.gal : 5 ms
[2025-06-07 14:55:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2707988510919007699.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/ReachabilityCardinality8230399702486666419.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2707988510919007699.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2707988510919007699.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 192
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :192 after 233
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 371
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :371 after 5343
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5343 after 15510
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :15510 after 1.06857e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.06857e+06 after 2.18517e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.18517e+08 after 7.33904e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.33904e+08 after 1.52882e+12
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.52882e+12 after 8.65997e+14
Invariant property ShieldPPPt-PT-020B-ReachabilityCardinality-2025-02 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.65997e+14 after 3.26596e+19
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.26596e+19 after 2.81396e+20
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.81396e+20 after 2.33606e+26
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :2.33606e+26 after 1.54691e+31
Detected timeout of ITS tools.
[2025-06-07 14:56:03] [INFO ] Flatten gal took : 39 ms
[2025-06-07 14:56:03] [INFO ] Applying decomposition
[2025-06-07 14:56:03] [INFO ] Flatten gal took : 37 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/graph515694217430910145.txt' '-o' '/tmp/graph515694217430910145.bin' '-w' '/tmp/graph515694217430910145.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph515694217430910145.bin' '-l' '-1' '-v' '-w' '/tmp/graph515694217430910145.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:56:04] [INFO ] Decomposing Gal with order
[2025-06-07 14:56:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:56:04] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-07 14:56:04] [INFO ] Flatten gal took : 193 ms
[2025-06-07 14:56:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 17 ms.
[2025-06-07 14:56:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9146338677543189584.gal : 8 ms
[2025-06-07 14:56:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15667650792674790720.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/ReachabilityCardinality9146338677543189584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15667650792674790720.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15667650792674790720.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3 after 26784
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26784 after 2.87161e+13
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.87161e+13 after 5.23158e+18
SDD proceeding with computation,2 properties remain. new max is 1048576
SDD size :5.89927e+58 after 5.89927e+58
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34138 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 14:56:19] [INFO ] Flatten gal took : 62 ms
[2025-06-07 14:56:19] [INFO ] Applying decomposition
[2025-06-07 14:56:19] [INFO ] Flatten gal took : 68 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/graph9174555340540084370.txt' '-o' '/tmp/graph9174555340540084370.bin' '-w' '/tmp/graph9174555340540084370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9174555340540084370.bin' '-l' '-1' '-v' '-w' '/tmp/graph9174555340540084370.weights' '-q' '0' '-e' '0.001'
[2025-06-07 14:56:20] [INFO ] Decomposing Gal with order
[2025-06-07 14:56:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 14:56:20] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-07 14:56:20] [INFO ] Flatten gal took : 157 ms
[2025-06-07 14:56:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2025-06-07 14:56:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17841357319768529023.gal : 37 ms
[2025-06-07 14:56:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12438351061239672886.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/ReachabilityCardinality17841357319768529023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12438351061239672886.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
Loading property file /tmp/ReachabilityCardinality12438351061239672886.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 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 3618
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3618 after 1.62119e+53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.62119e+53 after 3.58193e+61
Detected timeout of ITS tools.
[2025-06-07 15:26:23] [INFO ] Flatten gal took : 266 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1424423654838817767
[2025-06-07 15:26:24] [INFO ] Applying decomposition
[2025-06-07 15:26:24] [INFO ] Flatten gal took : 114 ms
[2025-06-07 15:26:24] [INFO ] Computing symmetric may disable matrix : 431 transitions.
[2025-06-07 15:26:24] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 15:26:24] [INFO ] Computing symmetric may enable matrix : 431 transitions.
[2025-06-07 15:26:24] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 15:26:24] [INFO ] Computing Do-Not-Accords matrix : 431 transitions.
[2025-06-07 15:26:24] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 15:26:24] [INFO ] Built C files in 634ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1424423654838817767
Running compilation step : cd /tmp/ltsmin1424423654838817767;'/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'
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/graph15960628222992910830.txt' '-o' '/tmp/graph15960628222992910830.bin' '-w' '/tmp/graph15960628222992910830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15960628222992910830.bin' '-l' '-1' '-v' '-w' '/tmp/graph15960628222992910830.weights' '-q' '0' '-e' '0.001'
[2025-06-07 15:26:25] [INFO ] Decomposing Gal with order
[2025-06-07 15:26:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 15:26:25] [INFO ] Removed a total of 274 redundant transitions.
[2025-06-07 15:26:26] [INFO ] Flatten gal took : 158 ms
[2025-06-07 15:26:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 6 ms.
[2025-06-07 15:26:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9391959560026002612.gal : 4 ms
[2025-06-07 15:26:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17353937988368654502.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/ReachabilityCardinality9391959560026002612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17353937988368654502.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17353937988368654502.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 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 6
Compilation finished in 1400 ms.
Running link step : cd /tmp/ltsmin1424423654838817767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin1424423654838817767;'/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' 'ShieldPPPtPT020BReachabilityCardinality202502==true'
Invariant property ShieldPPPt-PT-020B-ReachabilityCardinality-2025-02 does not hold.
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6912 after 1.819e+42
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( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Initializing POR dependencies: labels 433, guards 431
pins2lts-mc-linux64( 3/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.893: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 2.968: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 2.963: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 2.963: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 2.964: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 2.969: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 2.970: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 2.971: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 2.971: There are 433 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.971: State length is 513, there are 431 groups
pins2lts-mc-linux64( 0/ 8), 2.971: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.971: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.971: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 2.971: Visible groups: 0 / 431, labels: 1 / 433
pins2lts-mc-linux64( 0/ 8), 2.971: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 2.971: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 2.965: "ShieldPPPtPT020BReachabilityCardinality202502==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 3.014: ~13 levels ~960 states ~2328 transitions
pins2lts-mc-linux64( 0/ 8), 3.060: ~15 levels ~1920 states ~5392 transitions
pins2lts-mc-linux64( 0/ 8), 3.167: ~17 levels ~3840 states ~12616 transitions
pins2lts-mc-linux64( 3/ 8), 3.311: ~11 levels ~7680 states ~26888 transitions
pins2lts-mc-linux64( 2/ 8), 3.581: ~7 levels ~15360 states ~54896 transitions
pins2lts-mc-linux64( 2/ 8), 3.843: ~8 levels ~30720 states ~116400 transitions
pins2lts-mc-linux64( 2/ 8), 4.871: ~9 levels ~61440 states ~256304 transitions
pins2lts-mc-linux64( 6/ 8), 6.908: ~23 levels ~122880 states ~528464 transitions
pins2lts-mc-linux64( 5/ 8), 10.176: ~11 levels ~245760 states ~1106384 transitions
pins2lts-mc-linux64( 6/ 8), 16.010: ~25 levels ~491520 states ~2389856 transitions
pins2lts-mc-linux64( 6/ 8), 29.972: ~26 levels ~983040 states ~5451568 transitions
pins2lts-mc-linux64( 6/ 8), 56.018: ~27 levels ~1966080 states ~11417952 transitions
pins2lts-mc-linux64( 6/ 8), 114.358: ~28 levels ~3932160 states ~25012456 transitions
pins2lts-mc-linux64( 6/ 8), 232.603: ~29 levels ~7864320 states ~53961496 transitions
pins2lts-mc-linux64( 4/ 8), 461.604: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 461.701:
pins2lts-mc-linux64( 0/ 8), 461.701: mean standard work distribution: 4.2% (states) 1.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 461.701:
pins2lts-mc-linux64( 0/ 8), 461.701: Explored 13931611 states 110962840 transitions, fanout: 7.965
pins2lts-mc-linux64( 0/ 8), 461.701: Total exploration time 458.730 sec (458.640 sec minimum, 458.663 sec on average)
pins2lts-mc-linux64( 0/ 8), 461.701: States per second: 30370, Transitions per second: 241891
pins2lts-mc-linux64( 0/ 8), 461.701: Ignoring proviso: 9472227
pins2lts-mc-linux64( 0/ 8), 461.701:
pins2lts-mc-linux64( 0/ 8), 461.701: Queue width: 8B, total height: 13489222, memory: 102.91MB
pins2lts-mc-linux64( 0/ 8), 461.701: Tree memory: 465.2MB, 17.8 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 461.701: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 461.701: Stored 433 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 461.701: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 461.701: Est. total memory use: 568.1MB (~1126.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1424423654838817767;'/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' 'ShieldPPPtPT020BReachabilityCardinality202502==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1424423654838817767;'/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' 'ShieldPPPtPT020BReachabilityCardinality202502==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:114)
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533600886"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;