Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068100782.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 EisenbergMcGuire-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068100782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K 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.3K 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 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 753K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748840098361

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 04:54:59] [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-02 04:54:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 04:54:59] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-02 04:54:59] [INFO ] Transformed 414 places.
[2025-06-02 04:54:59] [INFO ] Transformed 1296 transitions.
[2025-06-02 04:54:59] [INFO ] Found NUPN structural information;
[2025-06-02 04:54:59] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1181 ms. (33 steps per ms) remains 5/13 properties
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 5/5 properties
[2025-06-02 04:55:00] [INFO ] Flatten gal took : 277 ms
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
[2025-06-02 04:55:00] [INFO ] Flatten gal took : 90 ms
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
[2025-06-02 04:55:00] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2025-06-02 04:55:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4832755492193688501.gal : 86 ms
[2025-06-02 04:55:00] [INFO ] Computed 19 invariants in 16 ms
[2025-06-02 04:55:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15293088835262586977.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/ReachabilityCardinality4832755492193688501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15293088835262586977.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2025-06-02 04:55:00] [INFO ] State equation strengthened by 314 read => feed constraints.

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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality15293088835262586977.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 356/397 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 356/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/408 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 11/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :14 after 16
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :16 after 35
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :35 after 113
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :113 after 190
At refinement iteration 8 (OVERLAPS) 702/1110 variables, 408/834 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :190 after 1131
At refinement iteration 9 (INCLUDED_ONLY) 0/1110 variables, 314/1148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1131 after 2281
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/1116 variables, 6/1154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 6/1160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 1/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1116 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1116/1116 variables, and 1161 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1334 ms.
Refiners :[Domain max(s): 414/414 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 414/414 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,5 properties remain. new max is 4096
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :2281 after 4548
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 356/397 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 356/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/408 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 11/426 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:02] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:02] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:02] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:03] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:03] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 8192
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :4548 after 26939
[2025-06-02 04:55:03] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 9/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 702/1110 variables, 408/843 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 314/1157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 2/1159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:04] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:04] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:04] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 3/1162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/1116 variables, 6/1168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 6/1174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 1/1175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :26939 after 71712
At refinement iteration 17 (INCLUDED_ONLY) 0/1116 variables, 3/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:06] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 24 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1116 variables, 1/1179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:06] [INFO ] Deduced a trap composed of 63 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-02 04:55:07] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 37 ms to minimize.
SMT process timed out in 6489ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 414 transition count 1294
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 412 transition count 1290
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 12 place count 408 transition count 1201
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 190 place count 319 transition count 1201
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 217 place count 292 transition count 1039
Iterating global reduction 3 with 27 rules applied. Total rules applied 244 place count 292 transition count 1039
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 300 place count 264 transition count 1011
Applied a total of 300 rules in 210 ms. Remains 264 /414 variables (removed 150) and now considering 1011/1296 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 264/414 places, 1011/1296 transitions.
RANDOM walk for 40000 steps (8 resets) in 436 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 436576 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :2 out of 5
Probabilistic random walk after 436576 steps, saw 162694 distinct states, run finished after 3006 ms. (steps per millisecond=145 ) properties seen :2
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 04:55:10] [INFO ] Flow matrix only has 417 transitions (discarded 594 similar events)
// Phase 1: matrix 417 rows 264 cols
[2025-06-02 04:55:10] [INFO ] Computed 19 invariants in 3 ms
[2025-06-02 04:55:10] [INFO ] State equation strengthened by 179 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 210/247 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/258 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 417/675 variables, 258/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 179/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/681 variables, 6/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD size :71712 after 133303
At refinement iteration 11 (OVERLAPS) 0/681 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 462 constraints, problems are : Problem set: 0 solved, 3 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 264/264 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 210/247 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/258 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:11] [INFO ] Deduced a trap composed of 3 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-02 04:55:11] [INFO ] Deduced a trap composed of 3 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-02 04:55:11] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:11] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:11] [INFO ] Deduced a trap composed of 3 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-02 04:55:11] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:11] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:11] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 417/675 variables, 258/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 179/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/681 variables, 6/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/681 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:12] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:12] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:12] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:12] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 18 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/681 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:13] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/681 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/681 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/681 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 480 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 264/264 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2683ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 887 ms.
Support contains 37 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1011/1011 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 264 transition count 1007
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 260 transition count 1007
Applied a total of 8 rules in 70 ms. Remains 260 /264 variables (removed 4) and now considering 1007/1011 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 260/264 places, 1007/1011 transitions.
RANDOM walk for 40000 steps (8 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 513268 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 3
Probabilistic random walk after 513268 steps, saw 161924 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2025-06-02 04:55:17] [INFO ] Flow matrix only has 413 transitions (discarded 594 similar events)
// Phase 1: matrix 413 rows 260 cols
[2025-06-02 04:55:17] [INFO ] Computed 19 invariants in 3 ms
[2025-06-02 04:55:17] [INFO ] State equation strengthened by 179 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 206/243 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/254 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 413/667 variables, 254/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 179/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/673 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/673 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 458 constraints, problems are : Problem set: 0 solved, 3 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 260/260 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 206/243 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/254 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 20 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-02 04:55:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:18] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 413/667 variables, 254/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 179/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/673 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/673 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/673 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/673 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:19] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 12 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/673 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:20] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:20] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/673 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/673 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/673 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 474 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2540 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 260/260 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2967ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 580 ms.
Support contains 37 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 1007/1007 transitions.
Applied a total of 0 rules in 27 ms. Remains 260 /260 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 260/260 places, 1007/1007 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 1007/1007 transitions.
Applied a total of 0 rules in 25 ms. Remains 260 /260 variables (removed 0) and now considering 1007/1007 (removed 0) transitions.
[2025-06-02 04:55:21] [INFO ] Flow matrix only has 413 transitions (discarded 594 similar events)
[2025-06-02 04:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:55:21] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-02 04:55:21] [INFO ] Flow matrix only has 413 transitions (discarded 594 similar events)
[2025-06-02 04:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:55:21] [INFO ] State equation strengthened by 179 read => feed constraints.
[2025-06-02 04:55:22] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:55:22] [INFO ] Redundant transitions in 58 ms returned []
Running 1001 sub problems to find dead transitions.
[2025-06-02 04:55:22] [INFO ] Flow matrix only has 413 transitions (discarded 594 similar events)
[2025-06-02 04:55:22] [INFO ] Invariant cache hit.
[2025-06-02 04:55:22] [INFO ] State equation strengthened by 179 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :133303 after 877914
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/260 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:27] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:27] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:27] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:27] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:27] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:28] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:28] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:28] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:28] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:28] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:29] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:29] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:29] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:29] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:29] [INFO ] Deduced a trap composed of 21 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-02 04:55:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:29] [INFO ] Deduced a trap composed of 11 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-02 04:55:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:30] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:30] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:31] [INFO ] Deduced a trap composed of 35 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-02 04:55:32] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:32] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:32] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:33] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:33] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:33] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:34] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:34] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:34] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:40] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:40] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:41] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:41] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:42] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:42] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:42] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:42] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:42] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:43] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:43] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:43] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:43] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:43] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:43] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:44] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:45] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:46] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:46] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:47] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1001 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:48] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 9 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :877914 after 9.6446e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:49] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:49] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:49] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:49] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:50] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:50] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:51] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:51] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:51] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:51] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:52] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:52] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:52] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:52] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:52] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 12 ms to minimize.
SMT process timed out in 30355ms, After SMT, problems are : Problem set: 0 solved, 1001 unsolved
Search for dead transitions found 0 dead transitions in 30361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31545 ms. Remains : 260/260 places, 1007/1007 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 750 edges and 260 vertex of which 29 / 260 are part of one of the 6 SCC in 3 ms
Free SCC test removed 23 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 591 transitions
Reduce isomorphic transitions removed 673 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 237 transition count 296
Reduce places removed 38 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 43 rules applied. Total rules applied 82 place count 199 transition count 291
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 194 transition count 290
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 88 place count 194 transition count 284
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 188 transition count 284
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 184 place count 146 transition count 242
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 195 place count 146 transition count 231
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 203 place count 142 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 142 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 223 place count 142 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 141 transition count 259
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 241 place count 141 transition count 243
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 257 place count 125 transition count 243
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 272 place count 125 transition count 243
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 125 transition count 243
Applied a total of 273 rules in 53 ms. Remains 125 /260 variables (removed 135) and now considering 243/1007 (removed 764) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 243 rows 125 cols
[2025-06-02 04:55:52] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 04:55:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-02 04:55:52] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-02 04:55:52] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 04:55:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-02 04:55:52] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2025-06-02 04:55:53] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 04:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2025-06-02 04:55:53] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-06-02 04:55:53] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-06-02 04:55:53] [INFO ] Flatten gal took : 21 ms
[2025-06-02 04:55:53] [INFO ] Flatten gal took : 11 ms
[2025-06-02 04:55:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13520221055557136636.gal : 2 ms
[2025-06-02 04:55:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10421151546425024170.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/ReachabilityCardinality13520221055557136636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10421151546425024170.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 ...330
Loading property file /tmp/ReachabilityCardinality10421151546425024170.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 84
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :84 after 110
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :110 after 8470
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :8470 after 50552
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :50552 after 66064
Reachability property EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-02 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :66064 after 339398
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :339398 after 380610
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :380610 after 3.29726e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.78752e+08,0.580166,7528,2,1097,17,17614,8,0,770,11022,0
Total reachable state count : 178752000

Verifying 3 reachability properties.
Reachability property EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-01,14364,0.581772,7528,2,326,17,17614,8,0,779,11022,0
Reachability property EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-02,28482,0.584957,7784,2,485,17,17614,9,0,834,11022,0
Invariant property EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-05 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-05,4332,0.587576,7784,2,342,17,17614,9,0,854,11022,0
Over-approximation ignoring read arcs solved 0 properties in 1082 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 04:55:53] [INFO ] Flatten gal took : 61 ms
[2025-06-02 04:55:53] [INFO ] Applying decomposition
[2025-06-02 04:55:54] [INFO ] Flatten gal took : 40 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/graph11025447842657221287.txt' '-o' '/tmp/graph11025447842657221287.bin' '-w' '/tmp/graph11025447842657221287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11025447842657221287.bin' '-l' '-1' '-v' '-w' '/tmp/graph11025447842657221287.weights' '-q' '0' '-e' '0.001'
[2025-06-02 04:55:54] [INFO ] Decomposing Gal with order
[2025-06-02 04:55:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 04:55:54] [INFO ] Removed a total of 2303 redundant transitions.
[2025-06-02 04:55:54] [INFO ] Flatten gal took : 209 ms
[2025-06-02 04:55:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 66 ms.
[2025-06-02 04:55:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12746455841789807309.gal : 18 ms
[2025-06-02 04:55:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14271657097428975665.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/ReachabilityCardinality12746455841789807309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14271657097428975665.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/ReachabilityCardinality14271657097428975665.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 125
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :125 after 924
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :924 after 33384
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :33384 after 921499
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.0055e+07 after 1.03281e+07
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.03281e+07 after 1.07346e+07
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.07346e+07 after 1.87479e+07
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.87479e+07 after 2.2802e+07
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.00437e+08 after 1.00447e+08
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.00447e+08 after 1.56772e+08
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :1.56772e+08 after 9.01317e+08
Invariant property EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-05 does not hold.
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-01 is true.
FORMULA EisenbergMcGuire-PT-06-ReachabilityCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.93341e+09 after 2.13754e+09
Detected timeout of ITS tools.
[2025-06-02 05:26:22] [INFO ] Flatten gal took : 330 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5715327244474152958
[2025-06-02 05:26:23] [INFO ] Applying decomposition
[2025-06-02 05:26:23] [INFO ] Computing symmetric may disable matrix : 1007 transitions.
[2025-06-02 05:26:23] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:26:23] [INFO ] Computing symmetric may enable matrix : 1007 transitions.
[2025-06-02 05:26:23] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:26:23] [INFO ] Flatten gal took : 246 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/graph10879355635739375529.txt' '-o' '/tmp/graph10879355635739375529.bin' '-w' '/tmp/graph10879355635739375529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10879355635739375529.bin' '-l' '-1' '-v' '-w' '/tmp/graph10879355635739375529.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:26:24] [INFO ] Decomposing Gal with order
[2025-06-02 05:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:26:24] [INFO ] Computing Do-Not-Accords matrix : 1007 transitions.
[2025-06-02 05:26:24] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:26:24] [INFO ] Removed a total of 1799 redundant transitions.
[2025-06-02 05:26:24] [INFO ] Flatten gal took : 125 ms
[2025-06-02 05:26:24] [INFO ] Built C files in 1603ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5715327244474152958
[2025-06-02 05:26:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 403 labels/synchronizations in 56 ms.
[2025-06-02 05:26:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8046142161471352784.gal : 16 ms
[2025-06-02 05:26:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3253886578539713556.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/ReachabilityCardinality8046142161471352784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3253886578539713556.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Running compilation step : cd /tmp/ltsmin5715327244474152958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality3253886578539713556.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 231
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :231 after 1319
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1319 after 52595
Compilation finished in 3943 ms.
Running link step : cd /tmp/ltsmin5715327244474152958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin5715327244474152958;'/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' 'EisenbergMcGuirePT06ReachabilityCardinality202502==true'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52595 after 196642
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :196642 after 2.31246e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.49382e+07 after 2.49527e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.61607e+07 after 8.96595e+07
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin5715327244474152958;'/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' 'EisenbergMcGuirePT06ReachabilityCardinality202502==true'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin5715327244474152958;'/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' 'EisenbergMcGuirePT06ReachabilityCardinality202502==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="EisenbergMcGuire-PT-06"
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 EisenbergMcGuire-PT-06, 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 r072-tall-174860068100782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 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 ;