Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r189-tall-174889271800043.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 RERS2020-PT-pb109, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-174889271800043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 86M
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 85M 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 StableMarking

=== Now, execution of the tool begins

BK_START 1748931522595

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb109
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-03 06:18:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-03 06:18:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:18:46] [INFO ] Load time of PNML (sax parser for PT used): 2556 ms
[2025-06-03 06:18:46] [INFO ] Transformed 1907 places.
[2025-06-03 06:18:46] [INFO ] Transformed 151872 transitions.
[2025-06-03 06:18:46] [INFO ] Found NUPN structural information;
[2025-06-03 06:18:46] [INFO ] Parsed PT model containing 1907 places and 151872 transitions and 605350 arcs in 3093 ms.
Ensure Unique test removed 6571 transitions
Reduce redundant transitions removed 6571 transitions.
RANDOM walk for 40000 steps (9 resets) in 15553 ms. (2 steps per ms) remains 1268/1907 properties
BEST_FIRST walk for 124 steps (8 resets) in 33 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 45 ms. (2 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 51 ms. (2 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 50 ms. (2 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 33 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 34 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 29 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 32 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 187 ms. (0 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 32 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 28 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 28 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 45 ms. (2 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 32 ms. (3 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 29 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 25 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 21 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1268/1268 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1268/1268 properties
[2025-06-03 06:18:53] [INFO ] Flow matrix only has 100719 transitions (discarded 44582 similar events)
// Phase 1: matrix 100719 rows 1907 cols
[2025-06-03 06:18:54] [INFO ] Computed 31 invariants in 741 ms
[2025-06-03 06:18:54] [INFO ] Flatten gal took : 5394 ms
[2025-06-03 06:18:58] [INFO ] Flatten gal took : 3627 ms
[2025-06-03 06:18:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14709047250410206531.gal : 609 ms
[2025-06-03 06:18:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14997247798208975384.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/ReachabilityCardinality14709047250410206531.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14997247798208975384.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
[2025-06-03 06:19:03] [INFO ] State equation strengthened by 5235 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.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality14997247798208975384.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/1268 variables, 1268/1268 constraints. Problems are: Problem set: 0 solved, 1268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1268/102626 variables, and 1268 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 5092 ms.
Refiners :[Domain max(s): 1268/1907 constraints, Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1907 constraints, ReadFeed: 0/5235 constraints, PredecessorRefiner: 1268/1248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1268 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1268 variables, 1268/1268 constraints. Problems are: Problem set: 0 solved, 1268 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 1268/102626 variables, and 1268 constraints, problems are : Problem set: 0 solved, 1268 unsolved in 5029 ms.
Refiners :[Domain max(s): 1268/1907 constraints, Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1907 constraints, ReadFeed: 0/5235 constraints, PredecessorRefiner: 20/1248 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42825ms problems are : Problem set: 0 solved, 1268 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1268 out of 1907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1907/1907 places, 145301/145301 transitions.
Ensure Unique test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 3364 transitions
Reduce isomorphic transitions removed 3364 transitions.
Iterating post reduction 0 with 3379 rules applied. Total rules applied 3379 place count 1892 transition count 141937
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 122 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 3385 place count 1889 transition count 141934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3386 place count 1889 transition count 141933
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 3396 place count 1889 transition count 141923
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 2 with 123 rules applied. Total rules applied 3519 place count 1879 transition count 141810
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3521 place count 1879 transition count 141808
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 3532 place count 1877 transition count 141799
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3534 place count 1877 transition count 141797
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 3539 place count 1875 transition count 141794
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3541 place count 1875 transition count 141792
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 3550 place count 1873 transition count 141785
Free-agglomeration rule (complex) applied 5 times with reduction of 132 identical transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 3555 place count 1873 transition count 143440
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 356 transitions
Reduce isomorphic transitions removed 359 transitions.
Iterating post reduction 6 with 364 rules applied. Total rules applied 3919 place count 1868 transition count 143081
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3920 place count 1867 transition count 143080
Applied a total of 3920 rules in 7703 ms. Remains 1867 /1907 variables (removed 40) and now considering 143080/145301 (removed 2221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7721 ms. Remains : 1867/1907 places, 143080/145301 transitions.
RANDOM walk for 525688 steps (8 resets) in 120005 ms. (4 steps per ms) remains 1213/1268 properties
BEST_FIRST walk for 4002 steps (8 resets) in 131 ms. (30 steps per ms) remains 1211/1213 properties
BEST_FIRST walk for 4004 steps (8 resets) in 335 ms. (11 steps per ms) remains 1211/1211 properties
BEST_FIRST walk for 4004 steps (8 resets) in 457 ms. (8 steps per ms) remains 1209/1211 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 140 ms. (28 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 170 ms. (23 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 141 ms. (28 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 127 ms. (31 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4004 steps (8 resets) in 146 ms. (27 steps per ms) remains 1209/1209 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 1209/1209 properties
Interrupted probabilistic random walk after 160672 steps, run timeout after 96004 ms. (steps per millisecond=1 ) properties seen :3 out of 1209
Probabilistic random walk after 160672 steps, saw 126671 distinct states, run finished after 96013 ms. (steps per millisecond=1 ) properties seen :3
[2025-06-03 06:21:52] [INFO ] Flow matrix only has 101868 transitions (discarded 41212 similar events)
// Phase 1: matrix 101868 rows 1867 cols
[2025-06-03 06:21:53] [INFO ] Computed 16 invariants in 574 ms
[2025-06-03 06:22:00] [INFO ] State equation strengthened by 5261 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.
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/1206 variables, 1206/1206 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/103735 variables, and 1206 constraints, problems are : Problem set: 0 solved, 1206 unsolved in 45033 ms.
Refiners :[Domain max(s): 1206/1867 constraints, Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/1867 constraints, ReadFeed: 0/5261 constraints, PredecessorRefiner: 1206/1190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1206 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1206 variables, 1206/1206 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1206 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
At refinement iteration 2 (OVERLAPS) 661/1867 variables, 16/1222 constraints. Problems are: Problem set: 0 solved, 1206 unsolved
SMT process timed out in 116032ms, After SMT, problems are : Problem set: 0 solved, 1206 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1206 out of 1867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1867/1867 places, 143080/143080 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 93 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1866 transition count 143079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1866 transition count 143078
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1866 transition count 143076
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1864 transition count 143073
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 1864 transition count 143070
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 35 place count 1861 transition count 143051
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 1861 transition count 143050
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 43 place count 1860 transition count 143044
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 1860 transition count 143782
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 609 transitions
Reduce isomorphic transitions removed 611 transitions.
Iterating post reduction 4 with 613 rules applied. Total rules applied 658 place count 1858 transition count 143171
Applied a total of 658 rules in 5157 ms. Remains 1858 /1867 variables (removed 9) and now considering 143171/143080 (removed -91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5160 ms. Remains : 1858/1867 places, 143171/143080 transitions.
RANDOM walk for 616534 steps (2 resets) in 120005 ms. (5 steps per ms) remains 1193/1206 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4003 steps (8 resets) in 125 ms. (31 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4003 steps (8 resets) in 140 ms. (28 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4003 steps (8 resets) in 129 ms. (30 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4002 steps (8 resets) in 135 ms. (29 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1192/1193 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 140 ms. (28 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 166 ms. (23 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 150 ms. (26 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 108 ms. (36 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4002 steps (8 resets) in 137 ms. (29 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4003 steps (8 resets) in 127 ms. (31 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1192/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1192/1192 properties
Interrupted probabilistic random walk after 159001 steps, run timeout after 96005 ms. (steps per millisecond=1 ) properties seen :0 out of 1192
Probabilistic random walk after 159001 steps, saw 125363 distinct states, run finished after 96006 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-03 06:26:02] [INFO ] Flow matrix only has 101953 transitions (discarded 41218 similar events)
// Phase 1: matrix 101953 rows 1858 cols
[2025-06-03 06:26:03] [INFO ] Computed 16 invariants in 521 ms
[2025-06-03 06:26:10] [INFO ] State equation strengthened by 5258 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.
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/1192 variables, 1192/1192 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
SDD proceeding with computation,1268 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1268 properties remain. new max is 8
SDD size :4 after 5
Invariant property smplace_708 does not hold.
SDD proceeding with computation,1267 properties remain. new max is 8
SDD size :5 after 8
Invariant property smplace_115 does not hold.
SDD proceeding with computation,1266 properties remain. new max is 8
SDD size :8 after 11
SDD proceeding with computation,1266 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,1266 properties remain. new max is 32
SDD size :15 after 16
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1192/103811 variables, and 1192 constraints, problems are : Problem set: 0 solved, 1192 unsolved in 75035 ms.
Refiners :[Domain max(s): 1192/1858 constraints, Positive P Invariants (semi-flows): 0/16 constraints, State Equation: 0/1858 constraints, ReadFeed: 0/5258 constraints, PredecessorRefiner: 1192/1176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1192 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1192 variables, 1192/1192 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Invariant property smplace_1105 does not hold.
SDD proceeding with computation,1265 properties remain. new max is 32
SDD size :16 after 27
SDD proceeding with computation,1265 properties remain. new max is 64
SDD size :27 after 30
SDD proceeding with computation,1265 properties remain. new max is 128
SDD size :30 after 31
Invariant property smplace_380 does not hold.
SDD proceeding with computation,1264 properties remain. new max is 128
SDD size :31 after 33
SDD proceeding with computation,1264 properties remain. new max is 256
SDD size :33 after 43
SDD proceeding with computation,1264 properties remain. new max is 512
SDD size :43 after 46
SDD proceeding with computation,1264 properties remain. new max is 1024
SDD size :46 after 49
SDD proceeding with computation,1264 properties remain. new max is 2048
SDD size :49 after 97
SDD proceeding with computation,1264 properties remain. new max is 4096
SDD size :1025 after 16001
At refinement iteration 1 (INCLUDED_ONLY) 0/1192 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 2 (OVERLAPS) 666/1858 variables, 16/1208 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1858 variables, 666/1874 constraints. Problems are: Problem set: 0 solved, 1192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:28:38] [INFO ] Deduced a trap composed of 108 places in 10634 ms of which 684 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1264 properties remain. new max is 8192
SDD size :16001 after 153361
[2025-06-03 06:28:48] [INFO ] Deduced a trap composed of 111 places in 9445 ms of which 562 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:28:58] [INFO ] Deduced a trap composed of 151 places in 9686 ms of which 623 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-03 06:29:03] [INFO ] Flatten gal took : 3741 ms
[2025-06-03 06:29:03] [INFO ] Applying decomposition
[2025-06-03 06:29:07] [INFO ] Flatten gal took : 4003 ms
[2025-06-03 06:29:08] [INFO ] Deduced a trap composed of 23 places in 10080 ms of which 343 ms to minimize.
SMT process timed out in 185672ms, After SMT, problems are : Problem set: 0 solved, 1192 unsolved
Fused 1192 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1192 out of 1858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1858/1858 places, 143171/143171 transitions.
Applied a total of 0 rules in 659 ms. Remains 1858 /1858 variables (removed 0) and now considering 143171/143171 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 1858/1858 places, 143171/143171 transitions.
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/graph10365990383124680833.txt' '-o' '/tmp/graph10365990383124680833.bin' '-w' '/tmp/graph10365990383124680833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10365990383124680833.bin' '-l' '-1' '-v' '-w' '/tmp/graph10365990383124680833.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:29:18] [INFO ] Decomposing Gal with order
[2025-06-03 06:29:18] [INFO ] Rewriting arrays to variables to allow decomposition.
RANDOM walk for 511400 steps (9 resets) in 120004 ms. (4 steps per ms) remains 1177/1192 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 127 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 196 ms. (20 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 176 ms. (22 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 182 ms. (21 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 183 ms. (21 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 161 ms. (24 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 127 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 125 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 418 ms. (9 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4002 steps (8 resets) in 122 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4002 steps (8 resets) in 136 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 135 ms. (29 steps per ms) remains 1177/1177 properties
BEST_FIRST walk for 4003 steps (8 resets) in 133 ms. (29 steps per ms) remains 1177/1177 properties
[2025-06-03 06:29:47] [INFO ] Removed a total of 283074 redundant transitions.
[2025-06-03 06:29:50] [INFO ] Flatten gal took : 26901 ms
[2025-06-03 06:30:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 9757 labels/synchronizations in 6476 ms.
[2025-06-03 06:30:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3814596894373397532.gal : 274 ms
[2025-06-03 06:30:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18425568387935988638.prop : 3 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/ReachabilityCardinality3814596894373397532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18425568387935988638.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/ReachabilityCardinality18425568387935988638.prop.
SDD proceeding with computation,1177 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 512
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 1024
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 2048
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 4096
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 8192
SDD size :1 after 1
SDD proceeding with computation,1177 properties remain. new max is 16384
SDD size :1 after 1
Interrupted probabilistic random walk after 151258 steps, run timeout after 96004 ms. (steps per millisecond=1 ) properties seen :0 out of 1177
Probabilistic random walk after 151258 steps, saw 119145 distinct states, run finished after 96005 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-03 06:31:17] [INFO ] Flow matrix only has 101953 transitions (discarded 41218 similar events)
[2025-06-03 06:31:17] [INFO ] Invariant cache hit.
SDD proceeding with computation,1177 properties remain. new max is 32768
SDD size :1 after 1
[2025-06-03 06:31:25] [INFO ] State equation strengthened by 5258 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.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
SDD proceeding with computation,1177 properties remain. new max is 65536
SDD size :1 after 1
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1177 variables, 1177/1177 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1177 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 2 (OVERLAPS) 681/1858 variables, 16/1193 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1858 variables, 681/1874 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 1.0 818.0))
(s2 (/ 1.0 818.0))
(s3 (/ 1.0 818.0))
(s4 0.0)
(s5 0.0)
(s6 (/ 1.0 818.0))
(s7 (/ 1.0 818.0))
(s8 (/ 1.0 818.0))
(s9 (/ 1.0 818.0))
(s10 0.0)
(s11 (/ 1.0 818.0))
(s12 0.0)
(s13 (/ 1.0 818.0))
(s14 (/ 1.0 818.0))
(s15 (/ 1.0 818.0))
(s16 0.0)
(s17 0.0)
(s18 (/ 1.0 818.0))
(s19 0.0)
(s20 (/ 1.0 818.0))
(s21 (/ 1.0 818.0))
(s22 0.0)
(s23 0.0)
(s24 (/ 1.0 818.0))
(s25 (/ 1.0 818.0))
(s26 0.0)
(s27 (/ 1.0 818.0))
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 (/ 1.0 818.0))
(s37 (/ 1.0 818.0))
(s38 0.0)
(s39 (/ 1.0 818.0))
(s40 0.0)
(s41 0.0)
(s42 (/ 1.0 818.0))
(s43 (/ 1.0 818.0))
(s44 (/ 1.0 818.0))
(s45 (/ 1.0 818.0))
(s46 (/ 1.0 818.0))
(s47 (/ 1.0 818.0))
(s48 (/ 1.0 818.0))
(s49 (/ 1.0 818.0))
(s50 0.0)
(s51 (/ 1.0 818.0))
(s52 (/ 1.0 818.0))
(s53 0.0)
(s54 (/ 1.0 818.0))
(s55 (/ 1.0 818.0))
(s56 0.0)
(s57 (/ 1.0 818.0))
(s58 0.0)
(s59 (/ 1.0 818.0))
(s60 (/ 1.0 818.0))
(s61 (/ 1.0 818.0))
(s62 (/ 1.0 818.0))
(s63 (/ 407.0 409.0))
(s64 (/ 1.0 818.0))
(s65 0.0)
(s66 (/ 1.0 818.0))
(s67 (/ 1.0 818.0))
(s68 (/ 1.0 818.0))
(s69 (/ 1.0 818.0))
(s70 0.0)
(s71 (/ 1.0 818.0))
(s72 0.0)
(s73 (/ 1.0 818.0))
(s74 0.0)
(s75 (/ 1.0 818.0))
(s76 0.0)
(s77 (/ 1.0 818.0))
(s78 0.0)
(s79 (/ 1.0 818.0))
(s80 (/ 1.0 818.0))
(s81 (/ 1.0 818.0))
(s82 0.0)
(s83 0.0)
(s84 (/ 1.0 818.0))
(s85 0.0)
(s86 (/ 1.0 818.0))
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 (/ 1.0 818.0))
(s91 0.0)
(s92 (/ 1.0 818.0))
(s93 (/ 1.0 818.0))
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 (/ 1.0 818.0))
(s98 (/ 1.0 818.0))
(s99 (/ 1.0 818.0))
(s100 (/ 1.0 818.0))
(s101 (/ 1.0 818.0))
(s102 (/ 701.0 818.0))
(s103 (/ 1.0 818.0))
(s104 (/ 1.0 818.0))
(s105 (/ 1.0 818.0))
(s106 (/ 1.0 818.0))
(s107 0.0)
(s108 (/ 1.0 818.0))
(s109 (/ 1.0 818.0))
(s110 0.0)
(s111 (/ 1.0 818.0))
(s112 0.0)
(s113 0.0)
(s114 (/ 1.0 818.0))
(s115 (/ 1.0 818.0))
(s116 0.0)
(s117 0.0)
(s118 (/ 1.0 818.0))
(s119 0.0)
(s120 (/ 1.0 818.0))
(s121 (/ 1.0 818.0))
(s122 (/ 1.0 818.0))
(s123 (/ 1.0 818.0))
(s124 0.0)
(s125 (/ 1.0 818.0))
(s126 (/ 1.0 818.0))
(s127 (/ 1.0 818.0))
(s128 (/ 1.0 818.0))
(s129 (/ 1.0 818.0))
(s130 (/ 1.0 818.0))
(s131 (/ 1.0 818.0))
(s132 0.0)
(s133 0.0)
(s134 (/ 1.0 818.0))
(s135 (/ 1.0 818.0))
(s136 (/ 1.0 818.0))
(s137 (/ 1.0 818.0))
(s138 0.0)
(s139 (/ 1.0 818.0))
(s140 (/ 1.0 818.0))
(s141 0.0)
(s142 (/ 1.0 818.0))
(s143 0.0)
(s144 (/ 1.0 818.0))
(s145 (/ 1.0 818.0))
(s146 0.0)
(s147 0.0)
(s148 (/ 1.0 818.0))
(s149 (/ 1.0 818.0))
(s150 0.0)
(s151 (/ 1.0 818.0))
(s152 0.0)
(s153 (/ 1.0 818.0))
(s154 0.0)
(s155 0.0)
(s156 (/ 1.0 818.0))
(s157 0.0)
(s158 (/ 1.0 818.0))
(s159 0.0)
(s160 (/ 1.0 818.0))
(s161 (/ 1.0 818.0))
(s162 0.0)
(s163 (/ 1.0 818.0))
(s164 (/ 1.0 818.0))
(s165 (/ 1.0 818.0))
(s166 (/ 1.0 818.0))
(s167 0.0)
(s168 (/ 1.0 818.0))
(s169 0.0)
(s170 (/ 1.0 818.0))
(s171 (/ 1.0 818.0))
(s172 0.0)
(s173 (/ 1.0 818.0))
(s174 (/ 1.0 818.0))
(s175 (/ 1.0 818.0))
(s176 (/ 1.0 818.0))
(s177 (/ 1.0 818.0))
(s178 0.0)
(s179 (/ 1.0 818.0))
(s180 0.0)
(s181 0.0)
(s182 (/ 1.0 818.0))
(s183 0.0)
(s184 (/ 1.0 818.0))
(s185 0.0)
(s186 (/ 1.0 818.0))
(s187 (/ 1.0 818.0))
(s188 (/ 1.0 818.0))
(s189 0.0)
(s190 0.0)
(s191 (/ 1.0 818.0))
(s192 0.0)
(s193 (/ 1.0 818.0))
(s194 (/ 1.0 818.0))
(s195 (/ 1.0 818.0))
(s196 (/ 1.0 818.0))
(s197 (/ 1.0 818.0))
(s198 (/ 1.0 818.0))
(s199 (/ 1.0 818.0))
(s200 (/ 1.0 818.0))
(s201 (/ 1.0 818.0))
(s202 (/ 1.0 818.0))
(s203 (/ 1.0 818.0))
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 (/ 1.0 818.0))
(s209 (/ 1.0 818.0))
(s210 (/ 1.0 818.0))
(s211 0.0)
(s212 (/ 1.0 818.0))
(s213 0.0)
(s214 0.0)
(s215 (/ 1.0 818.0))
(s216 (/ 1.0 818.0))
(s217 0.0)
(s218 0.0)
(s219 (/ 1.0 818.0))
(s220 0.0)
(s221 (/ 1.0 818.0))
(s222 0.0)
(s223 0.0)
(s224 (/ 1.0 818.0))
(s225 (/ 1.0 818.0))
(s226 0.0)
(s227 (/ 1.0 818.0))
(s228 (/ 1.0 818.0))
(s229 0.0)
(s230 (/ 1.0 818.0))
(s231 (/ 1.0 818.0))
(s232 (/ 1.0 818.0))
(s233 (/ 1.0 818.0))
(s234 0.0)
(s235 (/ 1.0 818.0))
(s236 (/ 1.0 818.0))
(s237 (/ 1.0 818.0))
(s238 0.0)
(s239 (/ 1.0 818.0))
(s240 (/ 1.0 818.0))
(s241 (/ 1.0 818.0))
(s242 (/ 1.0 818.0))
(s243 0.0)
(s244 (/ 1.0 818.0))
(s245 (/ 1.0 818.0))
(s246 (/ 1.0 818.0))
(s247 (/ 1.0 818.0))
(s248 (/ 1.0 818.0))
(s249 (/ 679.0 818.0))
(s250 0.0)
(s251 (/ 1.0 818.0))
(s252 0.0)
(s253 (/ 1.0 818.0))
(s254 (/ 1.0 818.0))
(s255 (/ 1.0 818.0))
(s256 (/ 1.0 818.0))
(s257 0.0)
(s258 (/ 1.0 818.0))
(s259 0.0)
(s260 (/ 1.0 818.0))
(s261 0.0)
(s262 (/ 1.0 818.0))
(s263 0.0)
(s264 0.0)
(s265 (/ 1.0 818.0))
(s266 0.0)
(s267 (/ 1.0 818.0))
(s268 0.0)
(s269 0.0)
(s270 (/ 1.0 818.0))
(s271 0.0)
(s272 (/ 1.0 818.0))
(s273 (/ 1.0 818.0))
(s274 (/ 1.0 818.0))
(s275 0.0)
(s276 (/ 1.0 818.0))
(s277 (/ 1.0 818.0))
(s278 (/ 1.0 818.0))
(s279 (/ 1.0 818.0))
(s280 (/ 1.0 818.0))
(s281 (/ 1.0 818.0))
(s282 0.0)
(s283 (/ 1.0 818.0))
(s284 (/ 1.0 818.0))
(s285 (/ 1.0 818.0))
(s286 0.0)
(s287 (/ 1.0 818.0))
(s288 (/ 1.0 818.0))
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 (/ 1.0 818.0))
(s293 0.0)
(s294 0.0)
(s295 (/ 1.0 818.0))
(s296 (/ 1.0 818.0))
(s297 (/ 1.0 818.0))
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 (/ 1.0 818.0))
(s302 0.0)
(s303 (/ 1.0 818.0))
(s304 0.0)
(s305 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1858/103811 variables, and 1874 constraints, problems are : Problem set: 0 solved, 1177 unsolved in 90027 ms.
Refiners :[Domain max(s): 1858/1858 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/1858 constraints, ReadFeed: 0/5258 constraints, PredecessorRefiner: 1177/1161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1177 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1177 variables, 1177/1177 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
SDD proceeding with computation,1177 properties remain. new max is 131072
SDD size :2 after 2
At refinement iteration 1 (INCLUDED_ONLY) 0/1177 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 2 (OVERLAPS) 681/1858 variables, 16/1193 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1858 variables, 681/1874 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:09] [INFO ] Deduced a trap composed of 108 places in 10993 ms of which 676 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:21] [INFO ] Deduced a trap composed of 111 places in 11499 ms of which 570 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:32] [INFO ] Deduced a trap composed of 151 places in 11265 ms of which 611 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:43] [INFO ] Deduced a trap composed of 23 places in 11117 ms of which 331 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:34:56] [INFO ] Deduced a trap composed of 99 places in 12793 ms of which 598 ms to minimize.
SMT process timed out in 219213ms, After SMT, problems are : Problem set: 0 solved, 1177 unsolved
Fused 1177 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1177 out of 1858 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1858/1858 places, 143171/143171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1858 transition count 143170
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1857 transition count 143169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 89 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 1856 transition count 143168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1856 transition count 143167
Applied a total of 6 rules in 2109 ms. Remains 1856 /1858 variables (removed 2) and now considering 143167/143171 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2110 ms. Remains : 1856/1858 places, 143167/143171 transitions.
RANDOM walk for 573616 steps (3 resets) in 120004 ms. (4 steps per ms) remains 1175/1177 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 129 ms. (30 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4002 steps (8 resets) in 111 ms. (35 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4002 steps (8 resets) in 117 ms. (33 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 127 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 115 ms. (34 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1175/1175 properties
SDD proceeding with computation,1177 properties remain. new max is 262144
SDD size :2 after 49
Interrupted probabilistic random walk after 131342 steps, run timeout after 96004 ms. (steps per millisecond=1 ) properties seen :0 out of 1175
Probabilistic random walk after 131342 steps, saw 103401 distinct states, run finished after 96008 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-03 06:37:06] [INFO ] Flow matrix only has 101949 transitions (discarded 41218 similar events)
// Phase 1: matrix 101949 rows 1856 cols
[2025-06-03 06:37:07] [INFO ] Computed 16 invariants in 641 ms
[2025-06-03 06:37:16] [INFO ] State equation strengthened by 5258 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.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1175 variables, 1175/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1175 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (OVERLAPS) 681/1856 variables, 16/1191 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1856 variables, 681/1872 constraints. Problems are: Problem set: 0 solved, 1175 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 Real declared 1856/103805 variables, and 1872 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 105042 ms.
Refiners :[Domain max(s): 1856/1856 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/1856 constraints, ReadFeed: 0/5258 constraints, PredecessorRefiner: 1175/1159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1175 variables, 1175/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1175 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (OVERLAPS) 681/1856 variables, 16/1191 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Detected timeout of ITS tools.
At refinement iteration 3 (INCLUDED_ONLY) 0/1856 variables, 681/1872 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:40:19] [INFO ] Deduced a trap composed of 108 places in 11753 ms of which 747 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:40:29] [INFO ] Deduced a trap composed of 111 places in 10157 ms of which 600 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:40:40] [INFO ] Deduced a trap composed of 157 places in 10596 ms of which 683 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:40:50] [INFO ] Deduced a trap composed of 169 places in 10198 ms of which 726 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:00] [INFO ] Deduced a trap composed of 102 places in 9969 ms of which 530 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:41:10] [INFO ] Deduced a trap composed of 145 places in 10123 ms of which 629 ms to minimize.
SMT process timed out in 243653ms, After SMT, problems are : Problem set: 0 solved, 1175 unsolved
Fused 1175 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1175 out of 1856 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1856/1856 places, 143167/143167 transitions.
Applied a total of 0 rules in 873 ms. Remains 1856 /1856 variables (removed 0) and now considering 143167/143167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 1856/1856 places, 143167/143167 transitions.
RANDOM walk for 738118 steps (1 resets) in 120004 ms. (6 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 152 ms. (26 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4002 steps (8 resets) in 145 ms. (27 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4002 steps (8 resets) in 134 ms. (29 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 159 ms. (25 steps per ms) remains 1175/1175 properties
BEST_FIRST walk for 4004 steps (8 resets) in 147 ms. (27 steps per ms) remains 1175/1175 properties
Interrupted probabilistic random walk after 150526 steps, run timeout after 93008 ms. (steps per millisecond=1 ) properties seen :0 out of 1175
Probabilistic random walk after 150526 steps, saw 118565 distinct states, run finished after 93011 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-03 06:43:16] [INFO ] Flow matrix only has 101949 transitions (discarded 41218 similar events)
[2025-06-03 06:43:16] [INFO ] Invariant cache hit.
[2025-06-03 06:43:23] [INFO ] State equation strengthened by 5258 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.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1175 variables, 1175/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1175 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (OVERLAPS) 681/1856 variables, 16/1191 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1856 variables, 681/1872 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1856/103805 variables, and 1872 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 120032 ms.
Refiners :[Domain max(s): 1856/1856 constraints, Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/1856 constraints, ReadFeed: 0/5258 constraints, PredecessorRefiner: 1175/1159 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1175 variables, 1175/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1175 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (OVERLAPS) 681/1856 variables, 16/1191 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1856 variables, 681/1872 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:46:38] [INFO ] Deduced a trap composed of 108 places in 10685 ms of which 734 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:46:49] [INFO ] Deduced a trap composed of 111 places in 10439 ms of which 642 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:46:59] [INFO ] Deduced a trap composed of 151 places in 10298 ms of which 671 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:09] [INFO ] Deduced a trap composed of 23 places in 9997 ms of which 321 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:22] [INFO ] Deduced a trap composed of 99 places in 12365 ms of which 682 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:34] [INFO ] Deduced a trap composed of 157 places in 12852 ms of which 968 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:47:47] [INFO ] Deduced a trap composed of 207 places in 12360 ms of which 1030 ms to minimize.
SMT process timed out in 270968ms, After SMT, problems are : Problem set: 0 solved, 1175 unsolved
Fused 1175 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1175 out of 1856 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1856/1856 places, 143167/143167 transitions.
Applied a total of 0 rules in 651 ms. Remains 1856 /1856 variables (removed 0) and now considering 143167/143167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 651 ms. Remains : 1856/1856 places, 143167/143167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1856/1856 places, 143167/143167 transitions.
Applied a total of 0 rules in 649 ms. Remains 1856 /1856 variables (removed 0) and now considering 143167/143167 (removed 0) transitions.
[2025-06-03 06:47:48] [INFO ] Flow matrix only has 101949 transitions (discarded 41218 similar events)
[2025-06-03 06:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:47:54] [INFO ] Implicit Places using invariants in 5366 ms returned []
Implicit Place search using SMT only with invariants took 5456 ms to find 0 implicit places.
Running 143159 sub problems to find dead transitions.
[2025-06-03 06:47:54] [INFO ] Flow matrix only has 101949 transitions (discarded 41218 similar events)
[2025-06-03 06:47:54] [INFO ] Invariant cache hit.
[2025-06-03 06:48:01] [INFO ] State equation strengthened by 5258 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.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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 StableMarking -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="RERS2020-PT-pb109"
export BK_EXAMINATION="StableMarking"
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 RERS2020-PT-pb109, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tall-174889271800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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