fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r002-tall-174853729000327
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ASLink-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 TFFF?TTFFTFTFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 544K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748573996110

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 02:59:57] [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-05-30 02:59:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:59:57] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-05-30 02:59:57] [INFO ] Transformed 1638 places.
[2025-05-30 02:59:57] [INFO ] Transformed 2094 transitions.
[2025-05-30 02:59:57] [INFO ] Found NUPN structural information;
[2025-05-30 02:59:57] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 245 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 (112 resets) in 1664 ms. (24 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (22 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
[2025-05-30 02:59:58] [INFO ] Flatten gal took : 400 ms
BEST_FIRST walk for 40004 steps (23 resets) in 498 ms. (80 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
[2025-05-30 02:59:58] [INFO ] Flatten gal took : 157 ms
BEST_FIRST walk for 40003 steps (17 resets) in 530 ms. (75 steps per ms) remains 11/11 properties
[2025-05-30 02:59:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13473963444081194203.gal : 123 ms
BEST_FIRST walk for 40002 steps (15 resets) in 297 ms. (134 steps per ms) remains 11/11 properties
[2025-05-30 02:59:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6453702174695027357.prop : 2 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/ReachabilityCardinality13473963444081194203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6453702174695027357.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (19 resets) in 224 ms. (177 steps per ms) remains 11/11 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 (23 resets) in 308 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (21 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (19 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality6453702174695027357.prop.
// Phase 1: matrix 2094 rows 1638 cols
[2025-05-30 02:59:59] [INFO ] Computed 160 invariants in 80 ms
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/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 319/478 variables, 30/189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 319/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 65/543 variables, 7/515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 65/580 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1080/1623 variables, 118/698 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :15 after 48
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :48 after 195
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :195 after 415
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :415 after 576
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :576 after 28824
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :28824 after 618138
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :618138 after 1.55917e+08
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.55917e+08 after 3.8973e+11
At refinement iteration 9 (INCLUDED_ONLY) 0/1623 variables, 1080/1778 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :3.8973e+11 after 3.42095e+15
At refinement iteration 10 (INCLUDED_ONLY) 0/1623 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5258ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 159 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1638 transition count 1788
Reduce places removed 306 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 317 rules applied. Total rules applied 623 place count 1332 transition count 1777
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 635 place count 1331 transition count 1766
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 646 place count 1320 transition count 1766
Performed 323 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 323 Pre rules applied. Total rules applied 646 place count 1320 transition count 1443
Deduced a syphon composed of 323 places in 7 ms
Ensure Unique test removed 22 places
Reduce places removed 345 places and 0 transitions.
Iterating global reduction 4 with 668 rules applied. Total rules applied 1314 place count 975 transition count 1443
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 18 rules applied. Total rules applied 1332 place count 969 transition count 1431
Reduce places removed 12 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 17 rules applied. Total rules applied 1349 place count 957 transition count 1426
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1354 place count 952 transition count 1426
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 1354 place count 952 transition count 1416
Deduced a syphon composed of 10 places in 6 ms
Ensure Unique test removed 9 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 29 rules applied. Total rules applied 1383 place count 933 transition count 1416
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 1383 place count 933 transition count 1409
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1397 place count 926 transition count 1409
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 1446 place count 877 transition count 1360
Iterating global reduction 7 with 49 rules applied. Total rules applied 1495 place count 877 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1496 place count 877 transition count 1359
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 1496 place count 877 transition count 1348
Deduced a syphon composed of 11 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 1519 place count 865 transition count 1348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1519 place count 865 transition count 1347
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1522 place count 863 transition count 1347
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1524 place count 861 transition count 1335
Iterating global reduction 8 with 2 rules applied. Total rules applied 1526 place count 861 transition count 1335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1526 place count 861 transition count 1333
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1530 place count 859 transition count 1333
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 8 with 149 rules applied. Total rules applied 1679 place count 784 transition count 1259
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1680 place count 783 transition count 1258
Iterating global reduction 8 with 1 rules applied. Total rules applied 1681 place count 783 transition count 1258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1683 place count 782 transition count 1267
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1691 place count 782 transition count 1259
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1699 place count 774 transition count 1259
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1700 place count 774 transition count 1259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1701 place count 773 transition count 1258
Applied a total of 1701 rules in 704 ms. Remains 773 /1638 variables (removed 865) and now considering 1258/2094 (removed 836) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 773/1638 places, 1258/2094 transitions.
RANDOM walk for 40000 steps (288 resets) in 480 ms. (83 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (80 resets) in 233 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (84 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (76 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (85 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (82 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (80 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (81 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (72 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (83 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (72 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (80 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :3.42095e+15 after 6.3593e+19
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :6.3593e+19 after 6.4085e+19
Interrupted probabilistic random walk after 248460 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :1 out of 11
Probabilistic random walk after 248460 steps, saw 68300 distinct states, run finished after 3006 ms. (steps per millisecond=82 ) properties seen :1
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1258 rows 773 cols
[2025-05-30 03:00:08] [INFO ] Computed 120 invariants in 20 ms
[2025-05-30 03:00:08] [INFO ] State equation strengthened by 12 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/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 159/305 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/316 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 454/770 variables, 88/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 3/773 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1258/2031 variables, 773/893 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2031 variables, 12/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2031 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/2031 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2031/2031 variables, and 905 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3589 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 773/773 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 10/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 159/305 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/316 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 454/770 variables, 88/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:13] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:13] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:14] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :6.4085e+19 after 7.17228e+19
[2025-05-30 03:00:14] [INFO ] Deduced a trap composed of 92 places in 244 ms of which 53 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/770 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:15] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 38 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/770 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/770 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 3/773 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:16] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/773 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-03b-ReachabilityFireability-2025-00 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2025-02 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2025-04 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2025-07 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2025-10 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03b-ReachabilityFireability-2025-14 is UNSAT
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 1258/2031 variables, 773/899 constraints. Problems are: Problem set: 6 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 131072
SDD size :7.17228e+19 after 8.08596e+19
At refinement iteration 13 (INCLUDED_ONLY) 0/2031 variables, 12/911 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2031 variables, 0/911 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2031 variables, 0/911 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2031/2031 variables, and 911 constraints, problems are : Problem set: 6 solved, 4 unsolved in 19787 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 773/773 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23477ms problems are : Problem set: 6 solved, 4 unsolved
Parikh walk visited 0 properties in 7591 ms.
Support contains 101 out of 773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 1258/1258 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 0 with 10 rules applied. Total rules applied 10 place count 773 transition count 1248
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 763 transition count 1247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 762 transition count 1247
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 22 place count 762 transition count 1214
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 92 place count 725 transition count 1214
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 3 with 1 rules applied. Total rules applied 93 place count 725 transition count 1213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 724 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 723 transition count 1207
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 723 transition count 1207
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 112 place count 715 transition count 1199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 715 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 714 transition count 1198
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 116 place count 714 transition count 1198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 713 transition count 1197
Applied a total of 117 rules in 233 ms. Remains 713 /773 variables (removed 60) and now considering 1197/1258 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 713/773 places, 1197/1258 transitions.
RANDOM walk for 40000 steps (344 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (95 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (100 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (106 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (79 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 320709 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :1 out of 4
Probabilistic random walk after 320709 steps, saw 93137 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :1
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1197 rows 713 cols
[2025-05-30 03:00:43] [INFO ] Computed 116 invariants in 15 ms
[2025-05-30 03:00:43] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 196/278 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/286 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 422/708 variables, 84/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/708 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/713 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1197/1910 variables, 713/829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1910 variables, 18/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1910 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1910 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1910/1910 variables, and 847 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 713/713 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 196/278 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/286 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 422/708 variables, 84/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:45] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 33 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/708 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/708 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 5/713 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1197/1910 variables, 713/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1910 variables, 18/848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:50] [INFO ] Deduced a trap along path composed of 2 places in 42 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1910 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:50] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 29 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1910 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:51] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 19 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1910 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1910 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1910 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1910/1910 variables, and 851 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7108 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 713/713 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8366ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1535 ms.
Support contains 82 out of 713 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 713/713 places, 1197/1197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 713 transition count 1195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 711 transition count 1195
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 4 place count 711 transition count 1186
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 22 place count 702 transition count 1186
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 696 transition count 1182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 696 transition count 1178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 694 transition count 1178
Applied a total of 38 rules in 52 ms. Remains 694 /713 variables (removed 19) and now considering 1178/1197 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 694/713 places, 1178/1197 transitions.
RANDOM walk for 40000 steps (368 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 298 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (110 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (96 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 339651 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 3
Probabilistic random walk after 339651 steps, saw 94032 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 1178 rows 694 cols
[2025-05-30 03:00:57] [INFO ] Computed 114 invariants in 16 ms
[2025-05-30 03:00:57] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 181/263 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/268 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 416/684 variables, 84/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 10/694 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1178/1872 variables, 694/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1872 variables, 23/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1872 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1872 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1872/1872 variables, and 831 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 694/694 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 181/263 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/268 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 416/684 variables, 84/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 10/694 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:58] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:59] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:00:59] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 28 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/694 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/694 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1178/1872 variables, 694/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,11 properties remain. new max is 262144
SDD size :8.08596e+19 after 1.16314e+20
At refinement iteration 11 (INCLUDED_ONLY) 0/1872 variables, 23/834 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:06] [INFO ] Deduced a trap composed of 41 places in 205 ms of which 29 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1872 variables, 1/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1872 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1872 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1872/1872 variables, and 835 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 694/694 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10254ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5912 ms.
Support contains 82 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1178/1178 transitions.
Applied a total of 0 rules in 20 ms. Remains 694 /694 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 694/694 places, 1178/1178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1178/1178 transitions.
Applied a total of 0 rules in 19 ms. Remains 694 /694 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
[2025-05-30 03:01:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:13] [INFO ] Implicit Places using invariants in 478 ms returned [23, 24, 25, 30, 45, 65, 84, 144, 198, 199, 200, 201, 204, 222, 240, 284, 353, 354, 357, 397, 488, 503, 504, 505, 506, 544, 546, 551, 571, 572, 573, 576, 593, 599, 606, 612, 618, 624, 630, 636, 642, 648, 654]
[2025-05-30 03:01:13] [INFO ] Actually due to overlaps returned [544, 45, 65, 204, 222, 357, 551, 571, 199, 200, 353, 504, 505, 23, 201, 354, 506, 546, 572, 84, 198, 240, 397, 503, 624, 642, 654, 24, 25, 30, 488, 573, 576, 593, 599, 606, 612, 618, 630, 636, 648]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 492 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 653/694 places, 1178/1178 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 651 transition count 1129
Reduce places removed 49 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 64 rules applied. Total rules applied 115 place count 602 transition count 1114
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 130 place count 587 transition count 1114
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 130 place count 587 transition count 1090
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 178 place count 563 transition count 1090
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 9 rules applied. Total rules applied 187 place count 558 transition count 1086
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 554 transition count 1086
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 191 place count 554 transition count 1085
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 553 transition count 1085
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 205 place count 541 transition count 1073
Iterating global reduction 5 with 12 rules applied. Total rules applied 217 place count 541 transition count 1073
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 217 place count 541 transition count 1072
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 540 transition count 1072
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 221 place count 538 transition count 1068
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 538 transition count 1068
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 271 place count 514 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 273 place count 512 transition count 1042
Iterating global reduction 5 with 2 rules applied. Total rules applied 275 place count 512 transition count 1042
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 277 place count 512 transition count 1040
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 281 place count 510 transition count 1044
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 282 place count 510 transition count 1043
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 284 place count 509 transition count 1042
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 291 place count 509 transition count 1035
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 298 place count 502 transition count 1035
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 304 place count 502 transition count 1035
Applied a total of 304 rules in 159 ms. Remains 502 /653 variables (removed 151) and now considering 1035/1178 (removed 143) transitions.
// Phase 1: matrix 1035 rows 502 cols
[2025-05-30 03:01:13] [INFO ] Computed 66 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:14] [INFO ] Implicit Places using invariants in 301 ms returned [93, 125, 128, 130, 237, 240, 242, 330, 352, 361, 368, 370, 480, 484, 488, 498]
[2025-05-30 03:01:14] [INFO ] Actually due to overlaps returned [370, 125, 130, 237, 242, 368, 480, 484, 488, 498, 93, 330, 352, 361]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 309 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 488/694 places, 1035/1178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 479 transition count 1024
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 479 transition count 1024
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 475 transition count 1018
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 475 transition count 1018
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 472 transition count 1015
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 472 transition count 1015
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 472 transition count 1013
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 471 transition count 1012
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 471 transition count 1012
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 467 transition count 1008
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 466 transition count 1008
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 466 transition count 1002
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 460 transition count 1002
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 460 transition count 1000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 458 transition count 1000
Applied a total of 62 rules in 130 ms. Remains 458 /488 variables (removed 30) and now considering 1000/1035 (removed 35) transitions.
// Phase 1: matrix 1000 rows 458 cols
[2025-05-30 03:01:14] [INFO ] Computed 52 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:14] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-05-30 03:01:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 03:01:15] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 458/694 places, 1000/1178 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2300 ms. Remains : 458/694 places, 1000/1178 transitions.
RANDOM walk for 40000 steps (437 resets) in 803 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (143 resets) in 222 ms. (179 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (124 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (125 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 505398 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 3
Probabilistic random walk after 505398 steps, saw 111282 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2025-05-30 03:01:18] [INFO ] Invariant cache hit.
[2025-05-30 03:01:18] [INFO ] State equation strengthened by 7 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/219 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/223 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 225/448 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 10/458 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1000/1458 variables, 458/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1458 variables, 7/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1458 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1458 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1458/1458 variables, and 517 constraints, problems are : Problem set: 0 solved, 3 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 458/458 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/219 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:19] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 225/448 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/458 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:20] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1000/1458 variables, 458/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1458 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1458 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1458 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1458/1458 variables, and 519 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2883 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 458/458 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3788ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1141 ms.
Support contains 82 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 458 /458 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 458/458 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 458 /458 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-05-30 03:01:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:24] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-30 03:01:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:01:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 03:01:25] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:01:25] [INFO ] Redundant transitions in 55 ms returned []
Running 990 sub problems to find dead transitions.
[2025-05-30 03:01:25] [INFO ] Invariant cache hit.
[2025-05-30 03:01:25] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 990 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 990 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:32] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:35] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 5 ms to minimize.
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:40] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 5 ms to minimize.
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD832 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:40] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:01:41] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 7 ms to minimize.
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 5/40 constraints. Problems are: Problem set: 8 solved, 982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1458 variables, and 40 constraints, problems are : Problem set: 8 solved, 982 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 31/39 constraints, State Equation: 0/458 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 990/990 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 982 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 4/4 constraints. Problems are: Problem set: 8 solved, 982 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 31/35 constraints. Problems are: Problem set: 8 solved, 982 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 5/40 constraints. Problems are: Problem set: 8 solved, 982 unsolved
SDD proceeding with computation,11 properties remain. new max is 524288
SDD size :1.16314e+20 after 5.67216e+20
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 982 unsolved
At refinement iteration 4 (OVERLAPS) 2/458 variables, 9/49 constraints. Problems are: Problem set: 8 solved, 982 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 8/57 constraints. Problems are: Problem set: 8 solved, 982 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:12] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:12] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:12] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:20] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:23] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:24] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:24] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:24] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1458 variables, and 65 constraints, problems are : Problem set: 8 solved, 982 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/458 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/990 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60398ms problems are : Problem set: 8 solved, 982 unsolved
Search for dead transitions found 8 dead transitions in 60403ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 458/458 places, 992/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 458 /458 variables (removed 0) and now considering 992/992 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:02:25] [INFO ] Redundant transitions in 152 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61803 ms. Remains : 458/458 places, 992/1000 transitions.
RANDOM walk for 40000 steps (445 resets) in 328 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (141 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (135 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (115 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 460205 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 3
Probabilistic random walk after 460205 steps, saw 103756 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 992 rows 458 cols
[2025-05-30 03:02:28] [INFO ] Computed 53 invariants in 9 ms
[2025-05-30 03:02:28] [INFO ] State equation strengthened by 7 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/219 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/223 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 225/448 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 10/458 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 992/1450 variables, 458/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1450 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1450 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1450/1450 variables, and 518 constraints, problems are : Problem set: 0 solved, 3 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 458/458 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 137/219 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:30] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 225/448 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10/458 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 992/1450 variables, 458/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1450 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1450 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1450 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1450/1450 variables, and 519 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 458/458 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3132ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4603 ms.
Support contains 82 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 992/992 transitions.
Applied a total of 0 rules in 11 ms. Remains 458 /458 variables (removed 0) and now considering 992/992 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 458/458 places, 992/992 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 992/992 transitions.
Applied a total of 0 rules in 10 ms. Remains 458 /458 variables (removed 0) and now considering 992/992 (removed 0) transitions.
[2025-05-30 03:02:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:02:36] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-05-30 03:02:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:02:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 03:02:37] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 03:02:37] [INFO ] Redundant transitions in 14 ms returned []
Running 982 sub problems to find dead transitions.
[2025-05-30 03:02:37] [INFO ] Invariant cache hit.
[2025-05-30 03:02:37] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:44] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:53] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:02:53] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/1450 variables, and 39 constraints, problems are : Problem set: 0 solved, 982 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/13 constraints, Generalized P Invariants (flows): 32/40 constraints, State Equation: 0/458 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 982 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/456 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 4 (OVERLAPS) 2/458 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:25] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:25] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:25] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:32] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:33] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:35] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:35] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:35] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:35] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:36] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 03:03:38] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 42 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1450 variables, and 67 constraints, problems are : Problem set: 0 solved, 982 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/458 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/982 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60335ms problems are : Problem set: 0 solved, 982 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61558 ms. Remains : 458/458 places, 992/992 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2330 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 991
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 456 transition count 991
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 456 transition count 989
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 454 transition count 989
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 452 transition count 988
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 451 transition count 988
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12 place count 451 transition count 987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 13 place count 450 transition count 987
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 15 place count 450 transition count 985
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 17 place count 448 transition count 985
Applied a total of 17 rules in 52 ms. Remains 448 /458 variables (removed 10) and now considering 985/992 (removed 7) transitions.
Running SMT prover for 3 properties.
Excessive predecessor constraint size, skipping predecessor.
// Phase 1: matrix 985 rows 448 cols
[2025-05-30 03:03:38] [INFO ] Computed 50 invariants in 12 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 03:03:38] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 03:03:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2025-05-30 03:03:38] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 13 ms returned sat
SDD proceeding with computation,11 properties remain. new max is 1048576
[2025-05-30 03:03:39] [INFO ] After 1282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2025-05-30 03:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD size :5.67216e+20 after 1.93562e+21
[2025-05-30 03:03:40] [INFO ] After 805ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2025-05-30 03:03:41] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2025-05-30 03:03:41] [INFO ] After 3138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2025-05-30 03:03:41] [INFO ] Flatten gal took : 50 ms
[2025-05-30 03:03:41] [INFO ] Flatten gal took : 41 ms
[2025-05-30 03:03:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7833557936812371204.gal : 9 ms
[2025-05-30 03:03:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10799170405854365861.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7833557936812371204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10799170405854365861.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/ReachabilityCardinality10799170405854365861.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :16 after 22
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :22 after 48
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :48 after 752
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :752 after 1984
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1984 after 150172
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :150172 after 349390
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :349390 after 399397
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :399397 after 5.15037e+06
Detected timeout of ITS tools.
[2025-05-30 03:03:56] [INFO ] Flatten gal took : 37 ms
[2025-05-30 03:03:56] [INFO ] Applying decomposition
[2025-05-30 03:03:56] [INFO ] Flatten gal took : 36 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/graph17900183440521892222.txt' '-o' '/tmp/graph17900183440521892222.bin' '-w' '/tmp/graph17900183440521892222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17900183440521892222.bin' '-l' '-1' '-v' '-w' '/tmp/graph17900183440521892222.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:03:57] [INFO ] Decomposing Gal with order
[2025-05-30 03:03:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:03:57] [INFO ] Removed a total of 1877 redundant transitions.
[2025-05-30 03:03:57] [INFO ] Flatten gal took : 151 ms
[2025-05-30 03:03:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 49 ms.
[2025-05-30 03:03:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14526871072635808592.gal : 30 ms
[2025-05-30 03:03:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17744029321470960116.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/ReachabilityCardinality14526871072635808592.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17744029321470960116.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 ...309
Loading property file /tmp/ReachabilityCardinality17744029321470960116.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :2 after 44
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :44 after 48
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :48 after 1.01062e+06
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2.42896e+06 after 5.4784e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :5.4784e+06 after 1.08534e+09
Reachability property ASLink-PT-03b-ReachabilityFireability-2024-06 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.14506e+09 after 1.25464e+10
Reachability property ASLink-PT-03b-ReachabilityFireability-2025-09 is true.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34255 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 03:04:12] [INFO ] Flatten gal took : 55 ms
[2025-05-30 03:04:12] [INFO ] Applying decomposition
[2025-05-30 03:04:12] [INFO ] Flatten gal took : 58 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/graph17023141536602275728.txt' '-o' '/tmp/graph17023141536602275728.bin' '-w' '/tmp/graph17023141536602275728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17023141536602275728.bin' '-l' '-1' '-v' '-w' '/tmp/graph17023141536602275728.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:04:12] [INFO ] Decomposing Gal with order
[2025-05-30 03:04:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:04:13] [INFO ] Removed a total of 1620 redundant transitions.
[2025-05-30 03:04:13] [INFO ] Flatten gal took : 106 ms
[2025-05-30 03:04:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 42 ms.
[2025-05-30 03:04:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12578007574143439337.gal : 19 ms
[2025-05-30 03:04:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality257125184144288998.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/ReachabilityCardinality12578007574143439337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality257125184144288998.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality257125184144288998.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1 after 4.51682e+16
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4.51682e+16 after 4.53737e+16
Reachability property ASLink-PT-03b-ReachabilityFireability-2024-06 is true.
FORMULA ASLink-PT-03b-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.53737e+16 after 3.55171e+21
Detected timeout of ITS tools.
[2025-05-30 03:34:14] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2351622865624409837
[2025-05-30 03:34:14] [INFO ] Applying decomposition
[2025-05-30 03:34:14] [INFO ] Computing symmetric may disable matrix : 992 transitions.
[2025-05-30 03:34:14] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:34:14] [INFO ] Computing symmetric may enable matrix : 992 transitions.
[2025-05-30 03:34:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:34:14] [INFO ] Flatten gal took : 63 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/graph10108647005921294869.txt' '-o' '/tmp/graph10108647005921294869.bin' '-w' '/tmp/graph10108647005921294869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10108647005921294869.bin' '-l' '-1' '-v' '-w' '/tmp/graph10108647005921294869.weights' '-q' '0' '-e' '0.001'
[2025-05-30 03:34:14] [INFO ] Decomposing Gal with order
[2025-05-30 03:34:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 03:34:14] [INFO ] Removed a total of 1833 redundant transitions.
[2025-05-30 03:34:14] [INFO ] Flatten gal took : 98 ms
[2025-05-30 03:34:14] [INFO ] Computing Do-Not-Accords matrix : 992 transitions.
[2025-05-30 03:34:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 48 ms.
[2025-05-30 03:34:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1109753265306360506.gal : 9 ms
[2025-05-30 03:34:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5245067304083391718.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability1109753265306360506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5245067304083391718.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2025-05-30 03:34:14] [INFO ] Computation of Completed DNA matrix. took 94 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 03:34:14] [INFO ] Built C files in 591ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2351622865624409837
Loading property file /tmp/ReachabilityFireability5245067304083391718.prop.
Running compilation step : cd /tmp/ltsmin2351622865624409837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4 after 48
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :48 after 1.1219e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.1219e+06 after 2.69465e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.69465e+06 after 3.8664e+08
Compilation finished in 3104 ms.
Running link step : cd /tmp/ltsmin2351622865624409837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin2351622865624409837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityFireability202503==true'
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.19136e+09 after 1.41238e+10
Reachability property ASLink-PT-03b-ReachabilityFireability-2025-09 is true.
FORMULA ASLink-PT-03b-ReachabilityFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.88687e+10 after 9.15524e+10
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin2351622865624409837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityFireability202503==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin2351622865624409837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT03bReachabilityFireability202503==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ASLink-PT-03b"
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 ASLink-PT-03b, 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 r002-tall-174853729000327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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