Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 152K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 179K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 769K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749006145998

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 03:02:27] [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-04 03:02:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:02:27] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2025-06-04 03:02:27] [INFO ] Transformed 618 places.
[2025-06-04 03:02:27] [INFO ] Transformed 3190 transitions.
[2025-06-04 03:02:27] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40001 steps (10 resets) in 1864 ms. (21 steps per ms) remains 8/16 properties
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 451 ms. (88 steps per ms) remains 8/8 properties
[2025-06-04 03:02:28] [INFO ] Flatten gal took : 365 ms
BEST_FIRST walk for 40002 steps (8 resets) in 782 ms. (51 steps per ms) remains 8/8 properties
[2025-06-04 03:02:28] [INFO ] Flatten gal took : 211 ms
BEST_FIRST walk for 40002 steps (8 resets) in 980 ms. (40 steps per ms) remains 8/8 properties
[2025-06-04 03:02:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3499645921546973932.gal : 121 ms
[2025-06-04 03:02:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15800759799360183613.prop : 9 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/ReachabilityCardinality3499645921546973932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15800759799360183613.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 544 ms. (73 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (9 resets) in 323 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 643 ms. (62 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality15800759799360183613.prop.
[2025-06-04 03:02:29] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2025-06-04 03:02:29] [INFO ] Computed 54 invariants in 84 ms
[2025-06-04 03:02:29] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-03 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-07 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 8/538 variables, 8/26 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 3/29 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :13 after 15
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 0/29 constraints. Problems are: Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :15 after 28
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-00 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-01 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-08 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 80/618 variables, 25/54 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 1 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :28 after 119
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :119 after 2723
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :2723 after 3618
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2158/2158 variables, and 672 constraints, problems are : Problem set: 7 solved, 1 unsolved in 2196 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 618/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/65 variables, 2/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 511/576 variables, 20/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:32] [INFO ] Deduced a trap composed of 272 places in 458 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:32] [INFO ] Deduced a trap composed of 278 places in 397 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:33] [INFO ] Deduced a trap composed of 283 places in 454 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:33] [INFO ] Deduced a trap composed of 309 places in 436 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:34] [INFO ] Deduced a trap composed of 315 places in 396 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:34] [INFO ] Deduced a trap composed of 320 places in 432 ms of which 122 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 6/30 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/30 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/592 variables, 13/43 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 0/43 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/616 variables, 16/59 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:35] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:35] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:35] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:35] [INFO ] Deduced a trap composed of 83 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-04 03:02:35] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 5/64 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 0/64 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2156/2158 variables, and 680 constraints, problems are : Problem set: 7 solved, 1 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 616/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7414ms problems are : Problem set: 7 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 614 transition count 1510
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 560 transition count 1510
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 112 place count 560 transition count 1439
Deduced a syphon composed of 71 places in 7 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 254 place count 489 transition count 1439
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 372 place count 430 transition count 1380
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 384 place count 430 transition count 1368
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 396 place count 418 transition count 1368
Applied a total of 396 rules in 315 ms. Remains 418 /618 variables (removed 200) and now considering 1368/1564 (removed 196) transitions.
Running 1364 sub problems to find dead transitions.
[2025-06-04 03:02:37] [INFO ] Flow matrix only has 1344 transitions (discarded 24 similar events)
// Phase 1: matrix 1344 rows 418 cols
[2025-06-04 03:02:37] [INFO ] Computed 50 invariants in 42 ms
[2025-06-04 03:02:37] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3618 after 162411
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :162411 after 173413
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :173413 after 280285
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :280285 after 432505
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 50 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-04 03:02:52] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:52] [INFO ] Deduced a trap composed of 49 places in 286 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:52] [INFO ] Deduced a trap composed of 50 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-04 03:02:54] [INFO ] Deduced a trap composed of 128 places in 428 ms of which 51 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1762 variables, and 56 constraints, problems are : Problem set: 0 solved, 1364 unsolved in 20058 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1364/884 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1364 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :432505 after 499865
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 1364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1762 variables, and 56 constraints, problems are : Problem set: 0 solved, 1364 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 480/884 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42169ms problems are : Problem set: 0 solved, 1364 unsolved
Search for dead transitions found 0 dead transitions in 42177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42511 ms. Remains : 418/618 places, 1368/1564 transitions.
RANDOM walk for 40000 steps (9 resets) in 508 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 177169 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 177169 steps, saw 124014 distinct states, run finished after 3007 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-04 03:03:22] [INFO ] Flow matrix only has 1344 transitions (discarded 24 similar events)
[2025-06-04 03:03:22] [INFO ] Invariant cache hit.
[2025-06-04 03:03:22] [INFO ] State equation strengthened by 120 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/268 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/280 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/416 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1344/1760 variables, 416/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1760 variables, 120/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1760 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1762 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1762 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1762 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1762 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1762/1762 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/268 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/280 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/416 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:24] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:24] [INFO ] Deduced a trap composed of 50 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-04 03:03:24] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/1762 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 416/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46395ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1368/1368 transitions.
Applied a total of 0 rules in 44 ms. Remains 418 /418 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 418/418 places, 1368/1368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1368/1368 transitions.
Applied a total of 0 rules in 59 ms. Remains 418 /418 variables (removed 0) and now considering 1368/1368 (removed 0) transitions.
[2025-06-04 03:04:09] [INFO ] Flow matrix only has 1344 transitions (discarded 24 similar events)
[2025-06-04 03:04:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:10] [INFO ] Implicit Places using invariants in 1503 ms returned [95, 134, 221, 243, 372]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1519 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 413/418 places, 1368/1368 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 411 transition count 1366
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 411 transition count 1366
Applied a total of 4 rules in 80 ms. Remains 411 /413 variables (removed 2) and now considering 1366/1368 (removed 2) transitions.
[2025-06-04 03:04:10] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 411 cols
[2025-06-04 03:04:10] [INFO ] Computed 45 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:12] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2025-06-04 03:04:12] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2025-06-04 03:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-04 03:04:21] [INFO ] Implicit Places using invariants and state equation in 8759 ms returned []
Implicit Place search using SMT with State Equation took 10794 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 411/418 places, 1366/1368 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 12453 ms. Remains : 411/418 places, 1366/1368 transitions.
RANDOM walk for 40000 steps (11 resets) in 565 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 213077 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 213077 steps, saw 149902 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2025-06-04 03:04:24] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2025-06-04 03:04:24] [INFO ] Invariant cache hit.
[2025-06-04 03:04:24] [INFO ] State equation strengthened by 120 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 307/361 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/381 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/409 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1342/1751 variables, 409/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1751 variables, 120/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1751 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1753 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1753 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1753 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1753 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1753/1753 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 411/411 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/54 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 307/361 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/381 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/409 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:26] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:26] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:26] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1342/1751 variables, 409/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1751 variables, 120/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1751 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1751 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1753 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1753 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1753 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1753 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1753/1753 variables, and 580 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 411/411 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3828ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1366/1366 transitions.
Applied a total of 0 rules in 25 ms. Remains 411 /411 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 411/411 places, 1366/1366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1366/1366 transitions.
Applied a total of 0 rules in 25 ms. Remains 411 /411 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
[2025-06-04 03:04:28] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2025-06-04 03:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:30] [INFO ] Implicit Places using invariants in 1706 ms returned []
[2025-06-04 03:04:30] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2025-06-04 03:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:04:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-04 03:04:39] [INFO ] Implicit Places using invariants and state equation in 8675 ms returned []
Implicit Place search using SMT with State Equation took 10384 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:04:39] [INFO ] Redundant transitions in 92 ms returned []
Running 1362 sub problems to find dead transitions.
[2025-06-04 03:04:39] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2025-06-04 03:04:39] [INFO ] Invariant cache hit.
[2025-06-04 03:04:39] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:52] [INFO ] Deduced a trap composed of 15 places in 255 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:53] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:53] [INFO ] Deduced a trap composed of 51 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-04 03:04:53] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:53] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:53] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:53] [INFO ] Deduced a trap composed of 51 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-04 03:04:53] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:53] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:54] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:04:56] [INFO ] Deduced a trap composed of 128 places in 275 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:03] [INFO ] Deduced a trap composed of 109 places in 253 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:03] [INFO ] Deduced a trap composed of 136 places in 261 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:04] [INFO ] Deduced a trap composed of 153 places in 327 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:06] [INFO ] Deduced a trap composed of 164 places in 380 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/1753 variables, and 56 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/411 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/884 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:05:34] [INFO ] Deduced a trap composed of 206 places in 335 ms of which 67 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/1753 variables, and 57 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/411 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 478/884 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61603ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 61607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72124 ms. Remains : 411/411 places, 1366/1366 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 411 transition count 1342
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 405 transition count 1402
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 1 with 48 rules applied. Total rules applied 84 place count 405 transition count 1354
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 405 transition count 1348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 96 place count 399 transition count 1348
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 399 transition count 1341
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 392 transition count 1341
Applied a total of 110 rules in 118 ms. Remains 392 /411 variables (removed 19) and now considering 1341/1366 (removed 25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1341 rows 392 cols
[2025-06-04 03:05:41] [INFO ] Computed 45 invariants in 16 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 03:05:41] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 03:05:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-04 03:05:41] [INFO ] [Nat]Absence check using 17 positive and 28 generalized place invariants in 24 ms returned sat
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :499865 after 2.02369e+06
[2025-06-04 03:05:44] [INFO ] After 3082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-04 03:05:45] [INFO ] After 3776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-04 03:05:45] [INFO ] After 4188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-04 03:05:45] [INFO ] Flatten gal took : 139 ms
[2025-06-04 03:05:45] [INFO ] Flatten gal took : 67 ms
[2025-06-04 03:05:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4168986610196738933.gal : 25 ms
[2025-06-04 03:05:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11493428516327286130.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/ReachabilityCardinality4168986610196738933.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11493428516327286130.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11493428516327286130.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 69
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :69 after 77
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :77 after 439
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :439 after 496
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :496 after 561
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :561 after 3246
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3246 after 3783
Detected timeout of ITS tools.
[2025-06-04 03:06:00] [INFO ] Flatten gal took : 57 ms
[2025-06-04 03:06:00] [INFO ] Applying decomposition
[2025-06-04 03:06:00] [INFO ] Flatten gal took : 57 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/graph1674282506656741264.txt' '-o' '/tmp/graph1674282506656741264.bin' '-w' '/tmp/graph1674282506656741264.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1674282506656741264.bin' '-l' '-1' '-v' '-w' '/tmp/graph1674282506656741264.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:06:01] [INFO ] Decomposing Gal with order
[2025-06-04 03:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:06:01] [INFO ] Removed a total of 677 redundant transitions.
[2025-06-04 03:06:01] [INFO ] Flatten gal took : 331 ms
[2025-06-04 03:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 372 labels/synchronizations in 35 ms.
[2025-06-04 03:06:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12045011082194000071.gal : 13 ms
[2025-06-04 03:06:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7080034094713780817.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/ReachabilityCardinality12045011082194000071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7080034094713780817.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7080034094713780817.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 35
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :35 after 112
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :112 after 133
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :133 after 159
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :159 after 543
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :543 after 5111
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5111 after 52255
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :52255 after 99751
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :99751 after 104384
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35942 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 03:06:17] [INFO ] Flatten gal took : 105 ms
[2025-06-04 03:06:17] [INFO ] Applying decomposition
[2025-06-04 03:06:17] [INFO ] Flatten gal took : 106 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/graph5765344237044029219.txt' '-o' '/tmp/graph5765344237044029219.bin' '-w' '/tmp/graph5765344237044029219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5765344237044029219.bin' '-l' '-1' '-v' '-w' '/tmp/graph5765344237044029219.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:06:17] [INFO ] Decomposing Gal with order
[2025-06-04 03:06:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:06:17] [INFO ] Removed a total of 1065 redundant transitions.
[2025-06-04 03:06:17] [INFO ] Flatten gal took : 134 ms
[2025-06-04 03:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 26 ms.
[2025-06-04 03:06:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1254552452834845275.gal : 12 ms
[2025-06-04 03:06:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8488153295727440620.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/ReachabilityCardinality1254552452834845275.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8488153295727440620.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/ReachabilityCardinality8488153295727440620.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 30
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :30 after 2007
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2007 after 2916
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2916 after 3732
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3732 after 139709
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :139709 after 2.785e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.785e+06 after 2.88385e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.88385e+06 after 3.13655e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.13655e+06 after 3.52739e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.52739e+06 after 9.87962e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.87962e+06 after 2.79572e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.79572e+07 after 3.65319e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :3.65319e+07 after 9.47819e+07
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :9.47819e+07 after 2.28664e+08
Detected timeout of ITS tools.
[2025-06-04 03:36:20] [INFO ] Flatten gal took : 474 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1171454964977588906
[2025-06-04 03:36:21] [INFO ] Applying decomposition
[2025-06-04 03:36:21] [INFO ] Computing symmetric may disable matrix : 1366 transitions.
[2025-06-04 03:36:21] [INFO ] Computation of Complete disable matrix. took 136 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:36:21] [INFO ] Flatten gal took : 348 ms
[2025-06-04 03:36:21] [INFO ] Computing symmetric may enable matrix : 1366 transitions.
[2025-06-04 03:36:21] [INFO ] Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10407680330368614642.txt' '-o' '/tmp/graph10407680330368614642.bin' '-w' '/tmp/graph10407680330368614642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10407680330368614642.bin' '-l' '-1' '-v' '-w' '/tmp/graph10407680330368614642.weights' '-q' '0' '-e' '0.001'
[2025-06-04 03:36:23] [INFO ] Decomposing Gal with order
[2025-06-04 03:36:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 03:36:23] [INFO ] Computing Do-Not-Accords matrix : 1366 transitions.
[2025-06-04 03:36:25] [INFO ] Computation of Completed DNA matrix. took 1219 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:36:25] [INFO ] Removed a total of 829 redundant transitions.
[2025-06-04 03:36:25] [INFO ] Built C files in 4783ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1171454964977588906
[2025-06-04 03:36:25] [INFO ] Flatten gal took : 906 ms
Running compilation step : cd /tmp/ltsmin1171454964977588906;'/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'
[2025-06-04 03:36:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 64 ms.
[2025-06-04 03:37:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5075232976440554345.gal : 23 ms
[2025-06-04 03:37:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality622878714894534058.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/ReachabilityCardinality5075232976440554345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality622878714894534058.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 ...327
Loading property file /tmp/ReachabilityCardinality622878714894534058.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 26
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :26 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 29
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29 after 31
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :31 after 55
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :55 after 68
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :68 after 106
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :106 after 143
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :143 after 243
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :243 after 1304
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1304 after 4713
Compilation finished in 72213 ms.
Running link step : cd /tmp/ltsmin1171454964977588906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 106 ms.
Running LTSmin : cd /tmp/ltsmin1171454964977588906;'/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' 'PolyORBLFPTS04J06T06ReachabilityCardinality202514==true'
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4713 after 14948
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14948 after 62825
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :62825 after 259837
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :259837 after 1.51853e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.51853e+06 after 9.29013e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :9.29013e+06 after 1.03505e+07

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="PolyORBLF-PT-S04J06T06"
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 PolyORBLF-PT-S04J06T06, 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 r156-tall-174881254100486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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