fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339900463
Last Updated
June 24, 2025

About the Execution of ITS-Tools for MedleyB-PT-B05

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 836752.00 0.00 0.00 TTTFFFFTFTFFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339900463.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 MedleyB-PT-B05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339900463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.0K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 1.2M Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749392517859

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 14:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 14:21:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 14:21:59] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-06-08 14:21:59] [INFO ] Transformed 1831 places.
[2025-06-08 14:21:59] [INFO ] Transformed 3454 transitions.
[2025-06-08 14:21:59] [INFO ] Found NUPN structural information;
[2025-06-08 14:21:59] [INFO ] Parsed PT model containing 1831 places and 3454 transitions and 22350 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (352 resets) in 1837 ms. (21 steps per ms) remains 14/16 properties
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (42 resets) in 428 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 269 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 185 ms. (215 steps per ms) remains 14/14 properties
[2025-06-08 14:22:00] [INFO ] Flatten gal took : 749 ms
BEST_FIRST walk for 40003 steps (58 resets) in 674 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (57 resets) in 820 ms. (48 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (58 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (58 resets) in 203 ms. (196 steps per ms) remains 13/14 properties
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (58 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
[2025-06-08 14:22:01] [INFO ] Flatten gal took : 453 ms
BEST_FIRST walk for 40004 steps (58 resets) in 312 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (59 resets) in 111 ms. (357 steps per ms) remains 13/13 properties
[2025-06-08 14:22:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3293051972026209245.gal : 170 ms
[2025-06-08 14:22:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16389853845438002337.prop : 11 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/ReachabilityCardinality3293051972026209245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16389853845438002337.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (56 resets) in 537 ms. (74 steps per ms) remains 13/13 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (57 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (57 resets) in 292 ms. (136 steps per ms) remains 13/13 properties
// Phase 1: matrix 3454 rows 1831 cols
[2025-06-08 14:22:01] [INFO ] Computed 7 invariants in 56 ms
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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Loading property file /tmp/ReachabilityCardinality16389853845438002337.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MedleyB-PT-B05-ReachabilityFireability-2025-04 is UNSAT
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B05-ReachabilityFireability-2025-11 is UNSAT
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1687/1831 variables, 7/151 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1831 variables, 1687/1838 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1831 variables, 0/1838 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3454/5285 variables, 1831/3669 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5285 variables, 0/3669 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/5285 variables, 0/3669 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5285/5285 variables, and 3669 constraints, problems are : Problem set: 2 solved, 11 unsolved in 3986 ms.
Refiners :[Domain max(s): 1831/1831 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1831/1831 constraints, PredecessorRefiner: 13/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem MedleyB-PT-B05-ReachabilityFireability-2025-00 is UNSAT
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1720/1831 variables, 7/118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1831 variables, 1720/1838 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :17 after 19
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :19 after 20
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :20 after 227
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :227 after 1208
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :1208 after 7224
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :7224 after 7989
[2025-06-08 14:22:07] [INFO ] Deduced a trap composed of 395 places in 868 ms of which 40 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :7989 after 93035
At refinement iteration 4 (INCLUDED_ONLY) 0/1831 variables, 1/1839 constraints. Problems are: Problem set: 3 solved, 10 unsolved
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :93035 after 328794
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:08] [INFO ] Deduced a trap composed of 395 places in 877 ms of which 229 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1831 variables, 1/1840 constraints. Problems are: Problem set: 3 solved, 10 unsolved
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :328794 after 4.367e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/1831 variables, 0/1840 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5285/5285 variables, and 3671 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5012 ms.
Refiners :[Domain max(s): 1831/1831 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1831/1831 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9209ms problems are : Problem set: 3 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 105 out of 1831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1831/1831 places, 3454/3454 transitions.
Graph (trivial) has 1595 edges and 1831 vertex of which 77 / 1831 are part of one of the 12 SCC in 6 ms
Free SCC test removed 65 places
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Graph (complete) has 2769 edges and 1766 vertex of which 1758 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.19 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1203 rules applied. Total rules applied 1205 place count 1758 transition count 2163
Reduce places removed 1199 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 1221 rules applied. Total rules applied 2426 place count 559 transition count 2141
Reduce places removed 10 places and 0 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Iterating post reduction 2 with 64 rules applied. Total rules applied 2490 place count 549 transition count 2087
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 56 rules applied. Total rules applied 2546 place count 495 transition count 2085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2547 place count 494 transition count 2085
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 88 Pre rules applied. Total rules applied 2547 place count 494 transition count 1997
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 176 rules applied. Total rules applied 2723 place count 406 transition count 1997
Discarding 81 places :
Symmetric choice reduction at 5 with 81 rule applications. Total rules 2804 place count 325 transition count 1916
Iterating global reduction 5 with 81 rules applied. Total rules applied 2885 place count 325 transition count 1916
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 5 with 9 rules applied. Total rules applied 2894 place count 325 transition count 1907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2895 place count 324 transition count 1907
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2915 place count 304 transition count 1887
Iterating global reduction 7 with 20 rules applied. Total rules applied 2935 place count 304 transition count 1887
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2937 place count 304 transition count 1885
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2946 place count 295 transition count 1876
Iterating global reduction 8 with 9 rules applied. Total rules applied 2955 place count 295 transition count 1876
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 2963 place count 287 transition count 1868
Iterating global reduction 8 with 8 rules applied. Total rules applied 2971 place count 287 transition count 1868
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 2977 place count 287 transition count 1862
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 3009 place count 271 transition count 1846
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 3015 place count 265 transition count 1840
Iterating global reduction 9 with 6 rules applied. Total rules applied 3021 place count 265 transition count 1840
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 3026 place count 260 transition count 1835
Iterating global reduction 9 with 5 rules applied. Total rules applied 3031 place count 260 transition count 1835
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3035 place count 256 transition count 1831
Iterating global reduction 9 with 4 rules applied. Total rules applied 3039 place count 256 transition count 1831
Performed 11 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 3061 place count 245 transition count 1844
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 3064 place count 245 transition count 1841
Free-agglomeration rule applied 35 times.
Iterating global reduction 9 with 35 rules applied. Total rules applied 3099 place count 245 transition count 1806
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 3134 place count 210 transition count 1806
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 3137 place count 210 transition count 1803
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 3150 place count 210 transition count 1803
Applied a total of 3150 rules in 743 ms. Remains 210 /1831 variables (removed 1621) and now considering 1803/3454 (removed 1651) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 754 ms. Remains : 210/1831 places, 1803/3454 transitions.
RANDOM walk for 40000 steps (2151 resets) in 1188 ms. (33 steps per ms) remains 9/10 properties
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (227 resets) in 86 ms. (459 steps per ms) remains 8/9 properties
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (281 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (313 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (282 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (319 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (298 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (272 resets) in 482 ms. (82 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (306 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (281 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
// Phase 1: matrix 1803 rows 210 cols
[2025-06-08 14:22:12] [INFO ] Computed 7 invariants in 19 ms
[2025-06-08 14:22:12] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 109/210 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :4.367e+06 after 1.76086e+08
At refinement iteration 3 (OVERLAPS) 1803/2013 variables, 210/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2013 variables, 48/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2013 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/2013 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2013/2013 variables, and 265 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1556 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 210/210 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 8/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 109/210 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:14] [INFO ] Deduced a trap composed of 44 places in 537 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:15] [INFO ] Deduced a trap composed of 43 places in 477 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:15] [INFO ] Deduced a trap composed of 26 places in 469 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1803/2013 variables, 210/220 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2013 variables, 48/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2013 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2013 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/2013 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2013/2013 variables, and 269 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3729 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 210/210 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 8/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5379ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 885 ms.
Support contains 97 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 1803/1803 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 210 transition count 1798
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 205 transition count 1797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 204 transition count 1797
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 201 transition count 1794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 201 transition count 1792
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 22 place count 199 transition count 1789
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 199 transition count 1789
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 25 place count 198 transition count 1788
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 198 transition count 1788
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 34 place count 198 transition count 1780
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 198 transition count 1779
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 41 place count 198 transition count 1773
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 47 place count 192 transition count 1773
Applied a total of 47 rules in 213 ms. Remains 192 /210 variables (removed 18) and now considering 1773/1803 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 192/210 places, 1773/1803 transitions.
RANDOM walk for 40000 steps (2221 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (305 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (357 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (296 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (342 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (294 resets) in 351 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (298 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
Invariant property MedleyB-PT-B05-ReachabilityFireability-2025-03 does not hold.
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.76086e+08 after 1.27583e+09
Interrupted probabilistic random walk after 438092 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 6
Probabilistic random walk after 438092 steps, saw 98503 distinct states, run finished after 3007 ms. (steps per millisecond=145 ) properties seen :0
// Phase 1: matrix 1773 rows 192 cols
[2025-06-08 14:22:22] [INFO ] Computed 7 invariants in 21 ms
[2025-06-08 14:22:22] [INFO ] State equation strengthened by 56 read => feed constraints.
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/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 95/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1773/1965 variables, 192/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1965 variables, 56/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1965 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1965 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 255 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 95/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:23] [INFO ] Deduced a trap composed of 39 places in 433 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:24] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:24] [INFO ] Deduced a trap composed of 35 places in 566 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:25] [INFO ] Deduced a trap composed of 24 places in 521 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:26] [INFO ] Deduced a trap composed of 44 places in 519 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:26] [INFO ] Deduced a trap composed of 45 places in 475 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:27] [INFO ] Deduced a trap composed of 44 places in 446 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,12 properties remain. new max is 65536
[2025-06-08 14:22:27] [INFO ] Deduced a trap composed of 27 places in 476 ms of which 20 ms to minimize.
SDD size :1.27583e+09 after 1.81692e+09
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:28] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1773/1965 variables, 192/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1965 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1965 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1965 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1965 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1965/1965 variables, and 265 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6619 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7793ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 165 ms.
Support contains 97 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 1773/1773 transitions.
Applied a total of 0 rules in 49 ms. Remains 192 /192 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 192/192 places, 1773/1773 transitions.
RANDOM walk for 40000 steps (2196 resets) in 356 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (300 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (307 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (328 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (283 resets) in 476 ms. (83 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (302 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 337464 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 5
Probabilistic random walk after 337464 steps, saw 74742 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-08 14:22:33] [INFO ] Invariant cache hit.
[2025-06-08 14:22:33] [INFO ] State equation strengthened by 56 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 95/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1773/1965 variables, 192/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1965 variables, 56/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1965 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/1965 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 255 constraints, problems are : Problem set: 0 solved, 5 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 95/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:35] [INFO ] Deduced a trap composed of 45 places in 466 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:35] [INFO ] Deduced a trap composed of 24 places in 516 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1773/1965 variables, 192/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1965 variables, 56/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1965 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:36] [INFO ] Deduced a trap composed of 44 places in 497 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1965 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:37] [INFO ] Deduced a trap composed of 41 places in 435 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1965 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1965 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:22:38] [INFO ] Deduced a trap composed of 114 places in 571 ms of which 30 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1965 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1965 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1965 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1965/1965 variables, and 261 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5921ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 463 ms.
Support contains 97 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 1773/1773 transitions.
Applied a total of 0 rules in 48 ms. Remains 192 /192 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 192/192 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 1773/1773 transitions.
Applied a total of 0 rules in 46 ms. Remains 192 /192 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2025-06-08 14:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 14:22:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-08 14:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 14:22:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-08 14:22:40] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 14:22:40] [INFO ] Redundant transitions in 117 ms returned []
Running 1757 sub problems to find dead transitions.
[2025-06-08 14:22:40] [INFO ] Invariant cache hit.
[2025-06-08 14:22:40] [INFO ] State equation strengthened by 56 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.
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :1.81692e+09 after 5.02954e+10
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:03] [INFO ] Deduced a trap composed of 51 places in 430 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:03] [INFO ] Deduced a trap composed of 46 places in 443 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:04] [INFO ] Deduced a trap composed of 52 places in 452 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:04] [INFO ] Deduced a trap composed of 44 places in 461 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:05] [INFO ] Deduced a trap composed of 55 places in 490 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:06] [INFO ] Deduced a trap composed of 45 places in 517 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:06] [INFO ] Deduced a trap composed of 45 places in 470 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:07] [INFO ] Deduced a trap composed of 45 places in 476 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:07] [INFO ] Deduced a trap composed of 48 places in 516 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:08] [INFO ] Deduced a trap composed of 41 places in 500 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:08] [INFO ] Deduced a trap composed of 40 places in 492 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:09] [INFO ] Deduced a trap composed of 41 places in 541 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:09] [INFO ] Deduced a trap composed of 40 places in 522 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:10] [INFO ] Deduced a trap composed of 41 places in 482 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:10] [INFO ] Deduced a trap composed of 41 places in 525 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:11] [INFO ] Deduced a trap composed of 42 places in 537 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:12] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:12] [INFO ] Deduced a trap composed of 44 places in 536 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:13] [INFO ] Deduced a trap composed of 46 places in 504 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:13] [INFO ] Deduced a trap composed of 46 places in 523 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/1965 variables, and 27 constraints, problems are : Problem set: 0 solved, 1757 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1757/207 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1757 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:22] [INFO ] Deduced a trap composed of 53 places in 481 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:23] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:24] [INFO ] Deduced a trap composed of 41 places in 494 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:25] [INFO ] Deduced a trap composed of 43 places in 483 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:25] [INFO ] Deduced a trap composed of 51 places in 547 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:26] [INFO ] Deduced a trap composed of 51 places in 537 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:26] [INFO ] Deduced a trap composed of 46 places in 493 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:27] [INFO ] Deduced a trap composed of 44 places in 517 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:28] [INFO ] Deduced a trap composed of 43 places in 500 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:28] [INFO ] Deduced a trap composed of 42 places in 525 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:29] [INFO ] Deduced a trap composed of 47 places in 479 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:30] [INFO ] Deduced a trap composed of 47 places in 472 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:34] [INFO ] Deduced a trap composed of 46 places in 505 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:34] [INFO ] Deduced a trap composed of 48 places in 466 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:35] [INFO ] Deduced a trap composed of 43 places in 556 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:36] [INFO ] Deduced a trap composed of 46 places in 558 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:36] [INFO ] Deduced a trap composed of 45 places in 578 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:37] [INFO ] Deduced a trap composed of 49 places in 579 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:38] [INFO ] Deduced a trap composed of 47 places in 532 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:38] [INFO ] Deduced a trap composed of 50 places in 522 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1757 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:40] [INFO ] Deduced a trap composed of 55 places in 461 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:41] [INFO ] Deduced a trap composed of 49 places in 462 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:42] [INFO ] Deduced a trap composed of 52 places in 486 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:42] [INFO ] Deduced a trap composed of 44 places in 482 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 14:23:43] [INFO ] Deduced a trap composed of 51 places in 471 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/1965 variables, and 52 constraints, problems are : Problem set: 0 solved, 1757 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/192 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1550/207 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63675ms problems are : Problem set: 0 solved, 1757 unsolved
Search for dead transitions found 0 dead transitions in 63689ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64511 ms. Remains : 192/192 places, 1773/1773 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 192 /192 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Running SMT prover for 5 properties.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-08 14:23:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 14:23:44] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 14:23:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-08 14:23:45] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2025-06-08 14:23:45] [INFO ] After 884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-08 14:23:45] [INFO ] After 1179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-06-08 14:23:46] [INFO ] Flatten gal took : 133 ms
[2025-06-08 14:23:46] [INFO ] Flatten gal took : 128 ms
[2025-06-08 14:23:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13907882061915260347.gal : 33 ms
[2025-06-08 14:23:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8669796875810452702.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13907882061915260347.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8669796875810452702.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8669796875810452702.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 19
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :19 after 24
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :24 after 41
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :41 after 365
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :365 after 493
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :493 after 4753
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :4753 after 10489
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :10489 after 21689
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :21689 after 45209
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :45209 after 2.26189e+06
Detected timeout of ITS tools.
[2025-06-08 14:24:01] [INFO ] Flatten gal took : 112 ms
[2025-06-08 14:24:01] [INFO ] Applying decomposition
[2025-06-08 14:24:01] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12372072536423496117.txt' '-o' '/tmp/graph12372072536423496117.bin' '-w' '/tmp/graph12372072536423496117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12372072536423496117.bin' '-l' '-1' '-v' '-w' '/tmp/graph12372072536423496117.weights' '-q' '0' '-e' '0.001'
[2025-06-08 14:24:02] [INFO ] Decomposing Gal with order
[2025-06-08 14:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 14:24:03] [INFO ] Removed a total of 9245 redundant transitions.
[2025-06-08 14:24:04] [INFO ] Flatten gal took : 1268 ms
[2025-06-08 14:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 118 ms.
[2025-06-08 14:24:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6405714377644751500.gal : 10 ms
[2025-06-08 14:24:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13902849957750818566.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6405714377644751500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13902849957750818566.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/ReachabilityCardinality13902849957750818566.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 129
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :129 after 297
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :297 after 1243
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1243 after 2380
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2380 after 2848
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2848 after 2920
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2920 after 17179
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34786 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 14:24:19] [INFO ] Flatten gal took : 122 ms
[2025-06-08 14:24:19] [INFO ] Applying decomposition
[2025-06-08 14:24:19] [INFO ] Flatten gal took : 123 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16550772967332261278.txt' '-o' '/tmp/graph16550772967332261278.bin' '-w' '/tmp/graph16550772967332261278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16550772967332261278.bin' '-l' '-1' '-v' '-w' '/tmp/graph16550772967332261278.weights' '-q' '0' '-e' '0.001'
[2025-06-08 14:24:20] [INFO ] Decomposing Gal with order
[2025-06-08 14:24:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 14:24:20] [INFO ] Removed a total of 9571 redundant transitions.
[2025-06-08 14:24:20] [INFO ] Flatten gal took : 238 ms
[2025-06-08 14:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 59 ms.
[2025-06-08 14:24:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4742202980689304654.gal : 31 ms
[2025-06-08 14:24:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11958586572542518354.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4742202980689304654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11958586572542518354.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/ReachabilityCardinality11958586572542518354.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :2 after 15
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8.3274e+06 after 5.02019e+11
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-15 is true.
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-12 is true.
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :5.02019e+11 after 5.3934e+13
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :5.3934e+13 after 5.42995e+13
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-13 is true.
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-09 is true.
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property MedleyB-PT-B05-ReachabilityFireability-2025-06 does not hold.
FORMULA MedleyB-PT-B05-ReachabilityFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.18197e+15,498.557,5219480,23571,31,2.1464e+06,2962,3726,6.28528e+07,51,9619,0
Total reachable state count : 1181968908990808

Verifying 5 reachability properties.
Invariant property MedleyB-PT-B05-ReachabilityFireability-2025-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B05-ReachabilityFireability-2025-06,3.24025e+12,618.461,5219480,3903,18,2.1464e+06,2962,3913,6.28528e+07,62,9619,0
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B05-ReachabilityFireability-2025-09,1.71747e+10,618.474,5219480,2542,15,2.1464e+06,2962,3918,6.28528e+07,64,9619,0
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B05-ReachabilityFireability-2025-12,2,618.483,5219480,396,9,2.1464e+06,2962,3941,6.28528e+07,64,9619,0
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B05-ReachabilityFireability-2025-13,1512,692.445,5219480,446,13,2.1464e+06,2962,4616,6.28528e+07,68,9619,0
Reachability property MedleyB-PT-B05-ReachabilityFireability-2025-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyB-PT-B05-ReachabilityFireability-2025-15,2,692.465,5219480,398,9,2.1464e+06,2962,4873,6.28528e+07,68,9619,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 835557 ms.

BK_STOP 1749393354611

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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