Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 201K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 781K 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 AutonomousCar-PT-09a-ReachabilityCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748657028212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 02:03:49] [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-05-31 02:03:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:03:49] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-05-31 02:03:49] [INFO ] Transformed 89 places.
[2025-05-31 02:03:49] [INFO ] Transformed 1249 transitions.
[2025-05-31 02:03:49] [INFO ] Found NUPN structural information;
[2025-05-31 02:03:49] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 245 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 345 transitions
Reduce redundant transitions removed 345 transitions.
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 02:03:50] [INFO ] Flatten gal took : 554 ms
RANDOM walk for 40000 steps (1972 resets) in 3571 ms. (11 steps per ms) remains 3/9 properties
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-31 02:03:50] [INFO ] Flatten gal took : 181 ms
BEST_FIRST walk for 40003 steps (156 resets) in 591 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (150 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
[2025-05-31 02:03:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10662055341513438239.gal : 105 ms
[2025-05-31 02:03:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1329026950174263828.prop : 6 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/ReachabilityCardinality10662055341513438239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1329026950174263828.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (138 resets) in 288 ms. (138 steps per ms) remains 3/3 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
[2025-05-31 02:03:51] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2025-05-31 02:03:51] [INFO ] Computed 14 invariants in 36 ms
[2025-05-31 02:03:51] [INFO ] State equation strengthened by 327 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality1329026950174263828.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 30/89 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 30/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 46
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :46 after 56
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :56 after 298
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :298 after 362
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :362 after 2212
At refinement iteration 6 (OVERLAPS) 902/991 variables, 89/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 326/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2212 after 8698
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/992 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8698 after 45176
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/992 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 519 constraints, problems are : Problem set: 0 solved, 3 unsolved in 705 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 3/0 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :45176 after 59650
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AutonomousCar-PT-09a-ReachabilityCardinality-2025-08 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-09a-ReachabilityCardinality-2025-10 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 30/89 variables, 11/73 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 30/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:52] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 38 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :59650 after 242178
At refinement iteration 7 (OVERLAPS) 902/991 variables, 89/193 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 326/519 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:52] [INFO ] Deduced a trap along path composed of 2 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:53] [INFO ] Deduced a trap along path composed of 2 places in 173 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:53] [INFO ] Deduced a trap along path composed of 2 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 3/522 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 0/522 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/992 variables, 1/523 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:53] [INFO ] Deduced a trap along path composed of 2 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 8192
[2025-05-31 02:03:53] [INFO ] Deduced a trap along path composed of 2 places in 54 ms of which 0 ms to minimize.
SDD size :242178 after 978898
At refinement iteration 12 (INCLUDED_ONLY) 0/992 variables, 2/525 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/992 variables, 0/525 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/992 variables, 0/525 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 525 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2122 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 2939ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 52 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 88 transition count 898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 85 transition count 898
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 85 transition count 895
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 82 transition count 895
Applied a total of 15 rules in 229 ms. Remains 82 /89 variables (removed 7) and now considering 895/904 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 82/89 places, 895/904 transitions.
RANDOM walk for 40000 steps (2119 resets) in 726 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (142 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :978898 after 3.94999e+06
Interrupted probabilistic random walk after 1121618 steps, run timeout after 3001 ms. (steps per millisecond=373 ) properties seen :0 out of 1
Probabilistic random walk after 1121618 steps, saw 171513 distinct states, run finished after 3006 ms. (steps per millisecond=373 ) properties seen :0
// Phase 1: matrix 895 rows 82 cols
[2025-05-31 02:03:57] [INFO ] Computed 14 invariants in 14 ms
[2025-05-31 02:03:57] [INFO ] State equation strengthened by 326 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/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/82 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 895/977 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 326/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/977 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 977/977 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Domain max(s): 82/82 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 82/82 constraints, ReadFeed: 326/326 constraints, PredecessorRefiner: 1/0 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/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/82 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 895/977 variables, 82/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 326/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:58] [INFO ] Deduced a trap along path composed of 2 places in 82 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:58] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:03:58] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/977 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/977 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/977 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 977/977 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1020 ms.
Refiners :[Domain max(s): 82/82 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 82/82 constraints, ReadFeed: 326/326 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 1404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 44 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 895/895 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 82 transition count 894
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 894
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 80 transition count 893
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 80 transition count 892
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 79 transition count 883
Applied a total of 15 rules in 117 ms. Remains 79 /82 variables (removed 3) and now considering 883/895 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 79/82 places, 883/895 transitions.
RANDOM walk for 40000 steps (2198 resets) in 872 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (152 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1056270 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 1
Probabilistic random walk after 1056270 steps, saw 160950 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
// Phase 1: matrix 883 rows 79 cols
[2025-05-31 02:04:02] [INFO ] Computed 14 invariants in 12 ms
[2025-05-31 02:04:02] [INFO ] State equation strengthened by 317 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/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/79 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 35/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 883/962 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/962 variables, 317/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/962 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/962 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Domain max(s): 79/79 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 79/79 constraints, ReadFeed: 317/317 constraints, PredecessorRefiner: 1/0 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/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/79 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 35/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:03] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 30 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 883/962 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/962 variables, 317/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:04] [INFO ] Deduced a trap along path composed of 2 places in 144 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:04] [INFO ] Deduced a trap along path composed of 2 places in 251 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:04] [INFO ] Deduced a trap along path composed of 2 places in 91 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:04] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:04] [INFO ] Deduced a trap along path composed of 2 places in 64 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/962 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/962 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 962/962 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1724 ms.
Refiners :[Domain max(s): 79/79 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 79/79 constraints, ReadFeed: 317/317 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 2054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 173 ms.
Support contains 44 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 883/883 transitions.
Applied a total of 0 rules in 40 ms. Remains 79 /79 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 79/79 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 883/883 transitions.
Applied a total of 0 rules in 66 ms. Remains 79 /79 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2025-05-31 02:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:04:05] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-05-31 02:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:04:05] [INFO ] State equation strengthened by 317 read => feed constraints.
[2025-05-31 02:04:06] [INFO ] Implicit Places using invariants and state equation in 705 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1017 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 78/79 places, 883/883 transitions.
Applied a total of 0 rules in 49 ms. Remains 78 /78 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1132 ms. Remains : 78/79 places, 883/883 transitions.
RANDOM walk for 40000 steps (2155 resets) in 825 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (152 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1071811 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 1
Probabilistic random walk after 1071811 steps, saw 163131 distinct states, run finished after 3002 ms. (steps per millisecond=357 ) properties seen :0
// Phase 1: matrix 883 rows 78 cols
[2025-05-31 02:04:09] [INFO ] Computed 13 invariants in 14 ms
[2025-05-31 02:04:09] [INFO ] State equation strengthened by 317 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/78 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 883/961 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 317/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/961 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 961/961 variables, and 486 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 317/317 constraints, PredecessorRefiner: 1/0 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/78 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 34/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 883/961 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 317/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:10] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 30 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:10] [INFO ] Deduced a trap along path composed of 2 places in 64 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:10] [INFO ] Deduced a trap along path composed of 2 places in 64 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:11] [INFO ] Deduced a trap along path composed of 2 places in 73 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:11] [INFO ] Deduced a trap along path composed of 2 places in 65 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:11] [INFO ] Deduced a trap along path composed of 2 places in 68 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:11] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 6/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/961 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/961 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 961/961 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1742 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 317/317 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2101ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 44 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 883/883 transitions.
Applied a total of 0 rules in 38 ms. Remains 78 /78 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 78/78 places, 883/883 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 883/883 transitions.
Applied a total of 0 rules in 38 ms. Remains 78 /78 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2025-05-31 02:04:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:04:12] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-31 02:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:04:12] [INFO ] State equation strengthened by 317 read => feed constraints.
[2025-05-31 02:04:13] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:04:13] [INFO ] Redundant transitions in 66 ms returned []
Running 882 sub problems to find dead transitions.
[2025-05-31 02:04:13] [INFO ] Invariant cache hit.
[2025-05-31 02:04:13] [INFO ] State equation strengthened by 317 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.
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.
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.
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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:21] [INFO ] Deduced a trap composed of 5 places in 365 ms of which 32 ms to minimize.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :3.94999e+06 after 9.24866e+06
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:04:26] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 6 (OVERLAPS) 883/961 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 317/488 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 961/961 variables, and 488 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30045 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 317/317 constraints, PredecessorRefiner: 882/53 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 6 (OVERLAPS) 883/961 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 317/488 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 961/961 variables, and 541 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30155 ms.
Refiners :[Domain max(s): 78/78 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 317/317 constraints, PredecessorRefiner: 882/53 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62192ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 62206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63436 ms. Remains : 78/78 places, 883/883 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 32 ms. Remains 78 /78 variables (removed 0) and now considering 883/883 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 02:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 02:05:15] [INFO ] After 39ms 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-05-31 02:05:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-05-31 02:05:15] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 02:05:15] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:05:15] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-31 02:05:15] [INFO ] Flatten gal took : 125 ms
[2025-05-31 02:05:16] [INFO ] Flatten gal took : 117 ms
[2025-05-31 02:05:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8934143278079438843.gal : 23 ms
[2025-05-31 02:05:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3808765104305930845.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/ReachabilityCardinality8934143278079438843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3808765104305930845.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/ReachabilityCardinality3808765104305930845.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 178
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :178 after 212
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :212 after 1130
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1130 after 6134
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6134 after 432226
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :432226 after 465634
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :9.24866e+06 after 1.69522e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :465634 after 1.70187e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.70187e+06 after 2.98659e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.98659e+06 after 6.74379e+06
Detected timeout of ITS tools.
[2025-05-31 02:05:31] [INFO ] Flatten gal took : 96 ms
[2025-05-31 02:05:31] [INFO ] Applying decomposition
[2025-05-31 02:05:31] [INFO ] Flatten gal took : 96 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/graph7386847065955613106.txt' '-o' '/tmp/graph7386847065955613106.bin' '-w' '/tmp/graph7386847065955613106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7386847065955613106.bin' '-l' '-1' '-v' '-w' '/tmp/graph7386847065955613106.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:05:31] [INFO ] Decomposing Gal with order
[2025-05-31 02:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:05:32] [INFO ] Removed a total of 5995 redundant transitions.
[2025-05-31 02:05:32] [INFO ] Flatten gal took : 326 ms
[2025-05-31 02:05:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 126 ms.
[2025-05-31 02:05:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13334520998738517079.gal : 19 ms
[2025-05-31 02:05:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6470253076151352279.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/ReachabilityCardinality13334520998738517079.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6470253076151352279.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6470253076151352279.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 159698
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :159698 after 7.20914e+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\_mod\_flat,1.51478e+09,7.19152,250492,10271,140,254644,2162,1851,2.03923e+06,97,16310,0
Total reachable state count : 1514779394

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-09a-ReachabilityCardinality-2025-14 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
AutonomousCar-PT-09a-ReachabilityCardinality-2025-14,1.82832e+06,8.86254,250492,2343,58,254644,2162,1968,2.03923e+06,112,16310,146518
Over-approximation ignoring read arcs solved 0 properties in 26011 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 02:05:41] [INFO ] Flatten gal took : 85 ms
[2025-05-31 02:05:41] [INFO ] Applying decomposition
[2025-05-31 02:05:41] [INFO ] Flatten gal took : 85 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/graph12335515719431477034.txt' '-o' '/tmp/graph12335515719431477034.bin' '-w' '/tmp/graph12335515719431477034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12335515719431477034.bin' '-l' '-1' '-v' '-w' '/tmp/graph12335515719431477034.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:05:41] [INFO ] Decomposing Gal with order
[2025-05-31 02:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:05:42] [INFO ] Removed a total of 6307 redundant transitions.
[2025-05-31 02:05:42] [INFO ] Flatten gal took : 129 ms
[2025-05-31 02:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 49 ms.
[2025-05-31 02:05:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4363568293211621293.gal : 6 ms
[2025-05-31 02:05:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7769266387603165602.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/ReachabilityCardinality4363568293211621293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7769266387603165602.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7769266387603165602.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4.28669e+06
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4.28669e+06 after 2.016e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.016e+07 after 2.19511e+07
Detected timeout of ITS tools.
[2025-05-31 02:35:46] [INFO ] Flatten gal took : 680 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10821477609894121697
[2025-05-31 02:35:47] [INFO ] Computing symmetric may disable matrix : 883 transitions.
[2025-05-31 02:35:47] [INFO ] Applying decomposition
[2025-05-31 02:35:47] [INFO ] Computation of Complete disable matrix. took 312 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:35:48] [INFO ] Computing symmetric may enable matrix : 883 transitions.
[2025-05-31 02:35:48] [INFO ] Flatten gal took : 693 ms
[2025-05-31 02:35:48] [INFO ] Computation of Complete enable matrix. took 131 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:35:50] [INFO ] Computing Do-Not-Accords matrix : 883 transitions.
[2025-05-31 02:35:50] [INFO ] Computation of Completed DNA matrix. took 129 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 02:35:50] [INFO ] Built C files in 3578ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10821477609894121697
Running compilation step : cd /tmp/ltsmin10821477609894121697;'/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'
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/graph16733872031141091822.txt' '-o' '/tmp/graph16733872031141091822.bin' '-w' '/tmp/graph16733872031141091822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16733872031141091822.bin' '-l' '-1' '-v' '-w' '/tmp/graph16733872031141091822.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:35:51] [INFO ] Decomposing Gal with order
[2025-05-31 02:35:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:35:51] [INFO ] Removed a total of 5995 redundant transitions.
[2025-05-31 02:35:51] [INFO ] Flatten gal took : 207 ms
[2025-05-31 02:35:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 81 ms.
[2025-05-31 02:35:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8721058850852987533.gal : 7 ms
[2025-05-31 02:35:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3612856934219946437.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/ReachabilityCardinality8721058850852987533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3612856934219946437.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3612856934219946437.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2.14445e+06
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2.14445e+06 after 8.85751e+06
Compilation finished in 43767 ms.
Running link step : cd /tmp/ltsmin10821477609894121697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin10821477609894121697;'/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' 'AutonomousCarPT09aReachabilityCardinality202514==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
petri\_inst\_inst\_mod\_flat,1.51478e+09,58.4294,1311768,11129,149,345905,1572,1997,1.56466e+07,99,14942,0
Total reachable state count : 1514779394

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-09a-ReachabilityCardinality-2025-14 does not hold.
FORMULA AutonomousCar-PT-09a-ReachabilityCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-09a-ReachabilityCardinality-2025-14,1.82832e+06,73.2268,1311768,2526,54,345905,1572,2113,1.56466e+07,114,14942,131932
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2035834 ms.

BK_STOP 1748659065563

--------------------
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="AutonomousCar-PT-09a"
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 AutonomousCar-PT-09a, 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 r002-tall-174853729900734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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