Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r091-smll-174860108200337.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 FlexibleBarrier-PT-20b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-smll-174860108200337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K 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.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748655257813

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2025-05-31 01:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-31 01:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 01:34:20] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2025-05-31 01:34:20] [INFO ] Transformed 5372 places.
[2025-05-31 01:34:20] [INFO ] Transformed 6193 transitions.
[2025-05-31 01:34:20] [INFO ] Found NUPN structural information;
[2025-05-31 01:34:20] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 755 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5310 edges and 5372 vertex of which 122 / 5372 are part of one of the 20 SCC in 33 ms
Free SCC test removed 102 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1309 transitions
Trivial Post-agglo rules discarded 1309 transitions
Performed 1309 trivial Post agglomeration. Transition count delta: 1309
Iterating post reduction 0 with 1309 rules applied. Total rules applied 1310 place count 5270 transition count 4781
Reduce places removed 1309 places and 0 transitions.
Iterating post reduction 1 with 1309 rules applied. Total rules applied 2619 place count 3961 transition count 4781
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 380 Pre rules applied. Total rules applied 2619 place count 3961 transition count 4401
Deduced a syphon composed of 380 places in 33 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 3379 place count 3581 transition count 4401
Performed 2335 Post agglomeration using F-continuation condition.Transition count delta: 2335
Deduced a syphon composed of 2335 places in 7 ms
Reduce places removed 2335 places and 0 transitions.
Iterating global reduction 2 with 4670 rules applied. Total rules applied 8049 place count 1246 transition count 2066
Applied a total of 8049 rules in 1218 ms. Remains 1246 /5372 variables (removed 4126) and now considering 2066/6193 (removed 4127) transitions.
[2025-05-31 01:34:22] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
// Phase 1: matrix 2007 rows 1246 cols
[2025-05-31 01:34:22] [INFO ] Computed 22 invariants in 150 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:34:25] [INFO ] Implicit Places using invariants in 3391 ms returned []
[2025-05-31 01:34:25] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2025-05-31 01:34:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:34:26] [INFO ] State equation strengthened by 121 read => feed constraints.
[2025-05-31 01:34:32] [INFO ] Implicit Places using invariants and state equation in 7405 ms returned []
Implicit Place search using SMT with State Equation took 10854 ms to find 0 implicit places.
Running 2065 sub problems to find dead transitions.
[2025-05-31 01:34:32] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2025-05-31 01:34:32] [INFO ] Invariant cache hit.
[2025-05-31 01:34:33] [INFO ] State equation strengthened by 121 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1245 variables, 1245/1245 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/3253 variables, and 1245 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 30128 ms.
Refiners :[Domain max(s): 1245/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 2065/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1245 variables, 1245/1245 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/3253 variables, and 1245 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 30073 ms.
Refiners :[Domain max(s): 1245/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 421/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63498ms problems are : Problem set: 0 solved, 2065 unsolved
Search for dead transitions found 0 dead transitions in 63543ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1246/5372 places, 2066/6193 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 75687 ms. Remains : 1246/5372 places, 2066/6193 transitions.
Discarding 1203 transitions out of 2066. Remains 863
Initial state reduction rules removed 1 formulas.
[2025-05-31 01:35:38] [INFO ] Flatten gal took : 729 ms
[2025-05-31 01:35:38] [INFO ] Flatten gal took : 358 ms
[2025-05-31 01:35:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality100963052303003780.gal : 199 ms
[2025-05-31 01:35:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10962622486780516352.prop : 37 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/ReachabilityCardinality100963052303003780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10962622486780516352.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/ReachabilityCardinality10962622486780516352.prop.
RANDOM walk for 40000 steps (1560 resets) in 11633 ms. (3 steps per ms) remains 780/862 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
[2025-05-31 01:35:39] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2025-05-31 01:35:39] [INFO ] Invariant cache hit.
[2025-05-31 01:35:39] [INFO ] State equation strengthened by 121 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Reachability property qltransition_1884 is true.
Reachability property qltransition_1883 is true.
Reachability property qltransition_1882 is true.
Reachability property qltransition_1881 is true.
Reachability property qltransition_1880 is true.
Reachability property qltransition_1879 is true.
Reachability property qltransition_1878 is true.
Reachability property qltransition_1877 is true.
Reachability property qltransition_1876 is true.
Reachability property qltransition_1875 is true.
Reachability property qltransition_1874 is true.
Reachability property qltransition_1873 is true.
Reachability property qltransition_1872 is true.
Reachability property qltransition_1871 is true.
Reachability property qltransition_1870 is true.
Reachability property qltransition_1869 is true.
Reachability property qltransition_1868 is true.
Reachability property qltransition_1867 is true.
Reachability property qltransition_1866 is true.
Reachability property qltransition_1865 is true.
SDD proceeding with computation,842 properties remain. new max is 2
SDD size :1 after 28
SDD proceeding with computation,842 properties remain. new max is 4
SDD size :28 after 730
SDD proceeding with computation,842 properties remain. new max is 8
SDD size :730 after 21142
SDD proceeding with computation,842 properties remain. new max is 16
SDD size :21142 after 703918
At refinement iteration 0 (INCLUDED_ONLY) 0/1162 variables, 1162/1162 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1162/3253 variables, and 1162 constraints, problems are : Problem set: 0 solved, 780 unsolved in 5043 ms.
Refiners :[Domain max(s): 1162/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 780/760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1162 variables, 1162/1162 constraints. Problems are: Problem set: 0 solved, 780 unsolved
SDD proceeding with computation,842 properties remain. new max is 32
SDD size :703918 after 6.74708e+08
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1162/3253 variables, and 1162 constraints, problems are : Problem set: 0 solved, 780 unsolved in 5034 ms.
Refiners :[Domain max(s): 1162/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 20/760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10698ms problems are : Problem set: 0 solved, 780 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1162 out of 1246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1246/1246 places, 2066/2066 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 1246 transition count 2006
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 82 place count 1246 transition count 1984
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 104 place count 1224 transition count 1984
Applied a total of 104 rules in 615 ms. Remains 1224 /1246 variables (removed 22) and now considering 1984/2066 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 1224/1246 places, 1984/2066 transitions.
SDD proceeding with computation,842 properties remain. new max is 64
SDD size :6.74708e+08 after 4.3283e+10
RANDOM walk for 1134862 steps (47202 resets) in 120011 ms. (9 steps per ms) remains 725/780 properties
BEST_FIRST walk for 4004 steps (0 resets) in 21 ms. (182 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 12 ms. (308 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 12 ms. (308 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 12 ms. (308 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 13 ms. (286 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
Probabilistic random walk after 1000001 steps, saw 319400 distinct states, run finished after 44054 ms. (steps per millisecond=22 ) properties seen :3
// Phase 1: matrix 1984 rows 1224 cols
[2025-05-31 01:37:05] [INFO ] Computed 22 invariants in 96 ms
[2025-05-31 01:37:05] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1103 variables, 1103/1103 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1103/3208 variables, and 1103 constraints, problems are : Problem set: 0 solved, 722 unsolved in 45030 ms.
Refiners :[Domain max(s): 1103/1224 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1224 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 722/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1103 variables, 1103/1103 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1103 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 121/1224 variables, 22/1125 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1224 variables, 121/1246 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1224/3208 variables, and 1246 constraints, problems are : Problem set: 0 solved, 722 unsolved in 45087 ms.
Refiners :[Domain max(s): 1224/1224 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1224 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 19/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90661ms problems are : Problem set: 0 solved, 722 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1103 out of 1224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1224/1224 places, 1984/1984 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1222 transition count 1982
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1222 transition count 1982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 1222 transition count 1981
Free-agglomeration rule applied 54 times.
Iterating global reduction 1 with 54 rules applied. Total rules applied 59 place count 1222 transition count 1927
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 113 place count 1168 transition count 1927
Applied a total of 113 rules in 632 ms. Remains 1168 /1224 variables (removed 56) and now considering 1927/1984 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 632 ms. Remains : 1168/1224 places, 1927/1984 transitions.
RANDOM walk for 1207889 steps (50225 resets) in 120004 ms. (10 steps per ms) remains 645/722 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 645/645 properties
// Phase 1: matrix 1927 rows 1168 cols
[2025-05-31 01:39:06] [INFO ] Computed 22 invariants in 64 ms
[2025-05-31 01:39:06] [INFO ] State equation strengthened by 175 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 150/1168 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/3095 variables, and 22 constraints, problems are : Problem set: 0 solved, 645 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1168 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 645/627 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 645 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1018 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 1 (OVERLAPS) 150/1168 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1168 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 645 unsolved
At refinement iteration 3 (OVERLAPS) 1927/3095 variables, 1168/1190 constraints. Problems are: Problem set: 0 solved, 645 unsolved
Reachability property qltransition_1522 is true.
Reachability property qltransition_1521 is true.
Reachability property qltransition_1520 is true.
Reachability property qltransition_1519 is true.
Reachability property qltransition_1518 is true.
Reachability property qltransition_1517 is true.
Reachability property qltransition_1516 is true.
Reachability property qltransition_1515 is true.
Reachability property qltransition_1514 is true.
Reachability property qltransition_1513 is true.
Reachability property qltransition_1512 is true.
Reachability property qltransition_1511 is true.
Reachability property qltransition_1510 is true.
Reachability property qltransition_1509 is true.
Reachability property qltransition_1508 is true.
Reachability property qltransition_1507 is true.
Reachability property qltransition_1506 is true.
Reachability property qltransition_1505 is true.
Reachability property qltransition_1504 is true.
Reachability property qltransition_1503 is true.
Reachability property qltransition_1486 is true.
Reachability property qltransition_1485 is true.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 150526ms, After SMT, problems are : Problem set: 20 solved, 625 unsolved
Fused 625 Parikh solutions to 253 different solutions.
Parikh walk visited 240 properties in 716 ms.
Support contains 615 out of 1168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1168/1168 places, 1927/1927 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 1046 transition count 1805
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 1046 transition count 1805
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 0 with 122 rules applied. Total rules applied 366 place count 1046 transition count 1683
Free-agglomeration rule applied 199 times.
Iterating global reduction 1 with 199 rules applied. Total rules applied 565 place count 1046 transition count 1484
Reachability property qltransition_1484 is true.
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 228 rules applied. Total rules applied 793 place count 847 transition count 1455
Applied a total of 793 rules in 385 ms. Remains 847 /1168 variables (removed 321) and now considering 1455/1927 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 847/1168 places, 1455/1927 transitions.
Reachability property qltransition_1483 is true.
RANDOM walk for 2121575 steps (83942 resets) in 120005 ms. (17 steps per ms) remains 188/384 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 187/188 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 186/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 185/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 184/185 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 183/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 182/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 181/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 180/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 179/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 178/179 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 177/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 176/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 175/176 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 174/175 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 173/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 172/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 171/172 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 170/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 169/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 168/169 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 167/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 166/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 165/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 164/165 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 163/164 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 162/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 161/162 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 160/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 159/160 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 158/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 157/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 156/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 155/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 154/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 153/154 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 152/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 151/152 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 150/151 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 149/150 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 148/149 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 147/148 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 146/147 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 145/146 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 144/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 143/144 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 142/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 141/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 140/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 139/140 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 138/139 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 137/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 136/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 135/136 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 134/135 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 133/134 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 132/133 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 131/132 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 130/131 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 129/130 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 128/129 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 127/128 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 126/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 125/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 124/125 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 123/124 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 122/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 121/122 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 120/121 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 119/120 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 118/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 117/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 116/117 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 115/116 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 114/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 113/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 112/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 111/112 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 110/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 109/110 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 107/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 106/107 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 105/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 104/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 103/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 102/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 101/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 100/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 99/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 98/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 97/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 96/97 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 95/96 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 94/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 93/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 92/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 91/92 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 90/91 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 89/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 88/89 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 87/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 86/87 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 85/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 84/85 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 83/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 82/83 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 81/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 80/81 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 79/80 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 78/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 77/78 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 76/77 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 75/76 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 74/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 73/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 72/73 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 71/72 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 70/71 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 69/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 68/69 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 67/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 66/67 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 65/66 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 64/65 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 63/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 62/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 61/62 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 60/61 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 59/60 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 58/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 57/58 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 56/57 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 55/56 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 54/55 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 53/54 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 52/53 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 51/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 50/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 49/50 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 48/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 47/48 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 46/47 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 45/46 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 44/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 43/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 42/43 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 41/42 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 40/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 39/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 38/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 37/38 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 36/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 35/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 34/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 33/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 32/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (9 resets) in 46 ms. (851 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (9 resets) in 49 ms. (800 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (9 resets) in 61 ms. (645 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (9 resets) in 53 ms. (740 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 32/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 32/32 properties
// Phase 1: matrix 1455 rows 847 cols
[2025-05-31 01:42:11] [INFO ] Computed 22 invariants in 62 ms
[2025-05-31 01:42:11] [INFO ] State equation strengthened by 345 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 776/810 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 37/847 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Reachability property qltransition_1482 is true.
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1455/2302 variables, 847/869 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2302 variables, 345/1214 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2302 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/2302 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2302/2302 variables, and 1214 constraints, problems are : Problem set: 0 solved, 32 unsolved in 19265 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 847/847 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 32/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 776/810 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 37/847 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1455/2302 variables, 847/869 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2302 variables, 345/1214 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2302 variables, 31/1245 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2302 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Reachability property qltransition_1481 is true.
At refinement iteration 9 (OVERLAPS) 0/2302 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2302/2302 variables, and 1245 constraints, problems are : Problem set: 0 solved, 32 unsolved in 17589 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 847/847 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 32/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36986ms problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 30 different solutions.
Finished Parikh walk after 15088 steps, including 111 resets, run visited all 1 properties in 151 ms. (steps per millisecond=99 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 32 properties in 1871 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 863 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 511142 ms.

BK_STOP 1748655771136

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 FlexibleBarrier-PT-20b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-smll-174860108200337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;