About the Execution of ITS-Tools for ASLink-PT-02b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 2108861.00 | 0.00 | 0.00 | FTFFFFFTFTTTFTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000310.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-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000310
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.4K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 417K 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-02b-ReachabilityCardinality-2025-00
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-01
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-02
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-03
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-04
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-05
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-06
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-07
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-08
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-09
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-10
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-11
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-12
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-13
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-14
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748569846183
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 01:50:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 01:50:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:50:47] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-05-30 01:50:47] [INFO ] Transformed 1242 places.
[2025-05-30 01:50:47] [INFO ] Transformed 1621 transitions.
[2025-05-30 01:50:47] [INFO ] Found NUPN structural information;
[2025-05-30 01:50:47] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (166 resets) in 1360 ms. (29 steps per ms) remains 4/11 properties
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 01:50:48] [INFO ] Flatten gal took : 254 ms
BEST_FIRST walk for 40003 steps (32 resets) in 546 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (34 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (35 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
[2025-05-30 01:50:48] [INFO ] Flatten gal took : 215 ms
BEST_FIRST walk for 40004 steps (23 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
[2025-05-30 01:50:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8596029428066981235.gal : 67 ms
[2025-05-30 01:50:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1927417716345830276.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/ReachabilityCardinality8596029428066981235.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1927417716345830276.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
// Phase 1: matrix 1621 rows 1242 cols
[2025-05-30 01:50:48] [INFO ] Computed 121 invariants in 95 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality1927417716345830276.prop.
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/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 47
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :47 after 194
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :964 after 14485
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :14485 after 399017
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
At refinement iteration 2 (OVERLAPS) 277/327 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 277/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 38/365 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 864/1229 variables, 90/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 864/1346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1229 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 13/1242 variables, 4/1350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 13/1363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1621/2863 variables, 1242/2605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2863 variables, 0/2605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2863 variables, 0/2605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2914 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Invariant property ASLink-PT-02b-ReachabilityCardinality-2025-12 does not hold.
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :6.03131e+09 after 7.20811e+13
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :7.20811e+13 after 7.22381e+13
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :7.22381e+13 after 7.26109e+13
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 277/327 variables, 21/71 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/327 variables, 277/348 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 38/365 variables, 6/354 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/392 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 864/1229 variables, 90/482 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 864/1346 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:50:56] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :7.26109e+13 after 7.27917e+13
[2025-05-30 01:50:58] [INFO ] Deduced a trap composed of 22 places in 1554 ms of which 29 ms to minimize.
SMT process timed out in 9682ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 1242 transition count 1371
Reduce places removed 250 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 258 rules applied. Total rules applied 508 place count 992 transition count 1363
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 519 place count 991 transition count 1353
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 529 place count 981 transition count 1353
Performed 267 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 267 Pre rules applied. Total rules applied 529 place count 981 transition count 1086
Deduced a syphon composed of 267 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 4 with 551 rules applied. Total rules applied 1080 place count 697 transition count 1086
Discarding 3 places :
Implicit places reduction removed 3 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 15 rules applied. Total rules applied 1095 place count 694 transition count 1074
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 13 rules applied. Total rules applied 1108 place count 682 transition count 1073
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1109 place count 681 transition count 1073
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 1109 place count 681 transition count 1068
Deduced a syphon composed of 5 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 1122 place count 673 transition count 1068
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1123 place count 672 transition count 1068
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1123 place count 672 transition count 1066
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1127 place count 670 transition count 1066
Discarding 35 places :
Symmetric choice reduction at 8 with 35 rule applications. Total rules 1162 place count 635 transition count 1031
Iterating global reduction 8 with 35 rules applied. Total rules applied 1197 place count 635 transition count 1031
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1198 place count 635 transition count 1030
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 1198 place count 635 transition count 1019
Deduced a syphon composed of 11 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 1221 place count 623 transition count 1019
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1221 place count 623 transition count 1018
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1224 place count 621 transition count 1018
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1226 place count 619 transition count 1003
Iterating global reduction 9 with 2 rules applied. Total rules applied 1228 place count 619 transition count 1003
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1228 place count 619 transition count 1002
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1230 place count 618 transition count 1002
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1231 place count 617 transition count 994
Iterating global reduction 9 with 1 rules applied. Total rules applied 1232 place count 617 transition count 994
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 9 with 126 rules applied. Total rules applied 1358 place count 553 transition count 932
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1359 place count 552 transition count 931
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 1361 place count 551 transition count 931
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1362 place count 550 transition count 930
Iterating global reduction 9 with 1 rules applied. Total rules applied 1363 place count 550 transition count 930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 1365 place count 550 transition count 928
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1366 place count 549 transition count 928
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1368 place count 548 transition count 937
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1369 place count 548 transition count 936
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1375 place count 548 transition count 930
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1381 place count 542 transition count 930
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1383 place count 542 transition count 928
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1385 place count 540 transition count 928
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1386 place count 539 transition count 927
Applied a total of 1386 rules in 520 ms. Remains 539 /1242 variables (removed 703) and now considering 927/1621 (removed 694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 539/1242 places, 927/1621 transitions.
RANDOM walk for 40000 steps (425 resets) in 512 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (115 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (104 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 479294 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 3
Probabilistic random walk after 479294 steps, saw 99443 distinct states, run finished after 3005 ms. (steps per millisecond=159 ) properties seen :0
// Phase 1: matrix 927 rows 539 cols
[2025-05-30 01:51:02] [INFO ] Computed 92 invariants in 33 ms
[2025-05-30 01:51:02] [INFO ] State equation strengthened by 14 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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 172/219 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/225 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 312/537 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/539 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 927/1466 variables, 539/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1466 variables, 14/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1466 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1466 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1466/1466 variables, and 645 constraints, problems are : Problem set: 0 solved, 3 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 539/539 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/2 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 172/219 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/225 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 312/537 variables, 66/90 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 01:51:03] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:03] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 42 ms to minimize.
Problem ASLink-PT-02b-ReachabilityCardinality-2025-11 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:04] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:04] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:04] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:04] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 6/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/539 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 65536
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD size :7.27917e+13 after 8.33088e+13
At refinement iteration 10 (OVERLAPS) 927/1466 variables, 539/637 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1466 variables, 14/651 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1466 variables, 1/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:06] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 22 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1466 variables, 1/653 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:06] [INFO ] Deduced a trap along path composed of 18 places in 58 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1466 variables, 1/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1466 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1466 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1466/1466 variables, and 654 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3696 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 539/539 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4751ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 375 ms.
Support contains 42 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 927/927 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 539 transition count 926
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 538 transition count 924
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 536 transition count 924
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 536 transition count 923
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 535 transition count 923
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 533 transition count 921
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 532 transition count 915
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 532 transition count 915
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 532 transition count 915
Applied a total of 15 rules in 71 ms. Remains 532 /539 variables (removed 7) and now considering 915/927 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 532/539 places, 915/927 transitions.
RANDOM walk for 40000 steps (413 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (122 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (109 resets) in 112 ms. (354 steps per ms) remains 1/2 properties
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 915 rows 532 cols
[2025-05-30 01:51:07] [INFO ] Computed 92 invariants in 13 ms
[2025-05-30 01:51:07] [INFO ] State equation strengthened by 14 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/214 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/220 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/531 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/532 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 915/1447 variables, 532/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1447 variables, 14/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1447 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1447 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1447/1447 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 532/532 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/214 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/220 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 311/531 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:08] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:08] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/532 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 915/1447 variables, 532/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1447 variables, 14/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:09] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 22 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1447 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1447 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1447 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1447/1447 variables, and 641 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1627 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 532/532 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2098ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 34 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 915/915 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 532 transition count 911
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 528 transition count 911
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 528 transition count 906
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 20 place count 521 transition count 906
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 521 transition count 904
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 518 transition count 904
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 517 transition count 903
Applied a total of 27 rules in 45 ms. Remains 517 /532 variables (removed 15) and now considering 903/915 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 517/532 places, 903/915 transitions.
RANDOM walk for 40000 steps (432 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (145 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 653505 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 1
Probabilistic random walk after 653505 steps, saw 134020 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
// Phase 1: matrix 903 rows 517 cols
[2025-05-30 01:51:12] [INFO ] Computed 89 invariants in 10 ms
[2025-05-30 01:51:12] [INFO ] State equation strengthened by 14 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/225 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/516 variables, 64/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/517 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 903/1420 variables, 517/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1420 variables, 14/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1420 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1420 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1420/1420 variables, and 620 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 517/517 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/225 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/516 variables, 64/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:13] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/517 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 903/1420 variables, 517/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1420 variables, 14/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1420 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1420 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1420/1420 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 517/517 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1761ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 34 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 903/903 transitions.
Applied a total of 0 rules in 14 ms. Remains 517 /517 variables (removed 0) and now considering 903/903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 517/517 places, 903/903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 903/903 transitions.
Applied a total of 0 rules in 14 ms. Remains 517 /517 variables (removed 0) and now considering 903/903 (removed 0) transitions.
[2025-05-30 01:51:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:15] [INFO ] Implicit Places using invariants in 389 ms returned [3, 20, 21, 24, 36, 71, 139, 160, 173, 174, 175, 176, 179, 219, 295, 315, 329, 331, 333, 380, 400, 401, 402, 403, 416, 422, 428, 434, 441, 447, 453, 459, 465, 471, 477]
[2025-05-30 01:51:15] [INFO ] Actually due to overlaps returned [36, 179, 380, 174, 175, 331, 176, 333, 400, 3, 20, 71, 173, 219, 402, 447, 465, 477, 21, 24, 139, 160, 315, 329, 401, 403, 416, 422, 428, 434, 441, 453, 459, 471]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 399 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 483/517 places, 903/903 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 482 transition count 874
Reduce places removed 29 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 37 rules applied. Total rules applied 67 place count 453 transition count 866
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 75 place count 445 transition count 866
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 75 place count 445 transition count 857
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 93 place count 436 transition count 857
Discarding 4 places :
Implicit places reduction removed 4 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 8 rules applied. Total rules applied 101 place count 432 transition count 853
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 105 place count 428 transition count 853
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 105 place count 428 transition count 852
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 107 place count 427 transition count 852
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 118 place count 416 transition count 841
Iterating global reduction 5 with 11 rules applied. Total rules applied 129 place count 416 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 129 place count 416 transition count 840
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 415 transition count 840
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 137 place count 409 transition count 834
Iterating global reduction 5 with 6 rules applied. Total rules applied 143 place count 409 transition count 834
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 146 place count 406 transition count 828
Iterating global reduction 5 with 3 rules applied. Total rules applied 149 place count 406 transition count 828
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 405 transition count 827
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 405 transition count 827
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 404 transition count 826
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 404 transition count 826
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 403 transition count 824
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 403 transition count 824
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 189 place count 386 transition count 807
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 384 transition count 805
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 384 transition count 805
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 195 place count 384 transition count 803
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 197 place count 384 transition count 801
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 200 place count 382 transition count 800
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 203 place count 382 transition count 797
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 206 place count 379 transition count 797
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 379 transition count 797
Applied a total of 207 rules in 151 ms. Remains 379 /483 variables (removed 104) and now considering 797/903 (removed 106) transitions.
// Phase 1: matrix 797 rows 379 cols
[2025-05-30 01:51:15] [INFO ] Computed 50 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:15] [INFO ] Implicit Places using invariants in 228 ms returned [77, 103, 120, 188, 240, 331, 351]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 231 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 372/517 places, 797/903 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 371 transition count 796
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 371 transition count 796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 370 transition count 795
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 370 transition count 795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 369 transition count 794
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 369 transition count 794
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 366 transition count 791
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 366 transition count 790
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 365 transition count 790
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 365 transition count 788
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 363 transition count 788
Applied a total of 18 rules in 101 ms. Remains 363 /372 variables (removed 9) and now considering 788/797 (removed 9) transitions.
// Phase 1: matrix 788 rows 363 cols
[2025-05-30 01:51:15] [INFO ] Computed 43 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:15] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-30 01:51:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 01:51:16] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 363/517 places, 788/903 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2039 ms. Remains : 363/517 places, 788/903 transitions.
RANDOM walk for 40000 steps (448 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (154 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :8.33088e+13 after 9.82483e+13
Interrupted probabilistic random walk after 697312 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 697312 steps, saw 178858 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2025-05-30 01:51:19] [INFO ] Invariant cache hit.
[2025-05-30 01:51:19] [INFO ] State equation strengthened by 6 read => feed constraints.
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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/140 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/144 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 218/362 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 788/1151 variables, 363/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1151 variables, 6/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1151 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1151 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 363/363 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/140 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:20] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/144 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 218/362 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:20] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/363 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 788/1151 variables, 363/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1151 variables, 6/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1151 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1151 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 363/363 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1689ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 34 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 788/788 transitions.
Applied a total of 0 rules in 10 ms. Remains 363 /363 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 363/363 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 788/788 transitions.
Applied a total of 0 rules in 10 ms. Remains 363 /363 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2025-05-30 01:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:21] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 01:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:51:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-30 01:51:22] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:51:22] [INFO ] Redundant transitions in 51 ms returned []
Running 778 sub problems to find dead transitions.
[2025-05-30 01:51:22] [INFO ] Invariant cache hit.
[2025-05-30 01:51:22] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:29] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:33] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 778 unsolved
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :9.82483e+13 after 1.32376e+14
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 4 (OVERLAPS) 2/363 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:48] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:48] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:48] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:49] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:49] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:49] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:49] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:50] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:52] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:51:53] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1151 variables, and 55 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/363 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 4 (OVERLAPS) 2/363 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:04] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:06] [INFO ] Deduced a trap composed of 95 places in 225 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:06] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:06] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:06] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:07] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:07] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:07] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:07] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:08] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:08] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:08] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:08] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:08] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:15] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:17] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:17] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:52:17] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 363/1151 variables, and 73 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/363 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61563 ms. Remains : 363/363 places, 788/788 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 363 transition count 784
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 359 transition count 784
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 355 transition count 784
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 352 transition count 781
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 352 transition count 781
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 349 transition count 778
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 349 transition count 778
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 346 transition count 775
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 346 transition count 775
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 346 transition count 772
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 345 transition count 771
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 345 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 344 transition count 770
Applied a total of 37 rules in 54 ms. Remains 344 /363 variables (removed 19) and now considering 770/788 (removed 18) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 770 rows 344 cols
[2025-05-30 01:52:23] [INFO ] Computed 39 invariants in 12 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 01:52:23] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 01:52:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2025-05-30 01:52:23] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 8 ms returned sat
[2025-05-30 01:52:24] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 01:52:24] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 01:52:24] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-05-30 01:52:24] [INFO ] Flatten gal took : 55 ms
[2025-05-30 01:52:24] [INFO ] Flatten gal took : 36 ms
[2025-05-30 01:52:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11858509602654866006.gal : 5 ms
[2025-05-30 01:52:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5725007598739158818.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/ReachabilityCardinality11858509602654866006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5725007598739158818.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/ReachabilityCardinality5725007598739158818.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 23
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :23 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 685
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :685 after 5293
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5293 after 215197
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :215197 after 251229
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :251229 after 273577
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :273577 after 421015
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :421015 after 1.11909e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.11909e+06 after 3.10275e+06
SDD proceeding with computation,3 properties remain. new max is 524288
SDD size :1.32376e+14 after 4.26926e+14
Detected timeout of ITS tools.
[2025-05-30 01:52:40] [INFO ] Flatten gal took : 31 ms
[2025-05-30 01:52:40] [INFO ] Applying decomposition
[2025-05-30 01:52:40] [INFO ] Flatten gal took : 29 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/graph18376627938871785827.txt' '-o' '/tmp/graph18376627938871785827.bin' '-w' '/tmp/graph18376627938871785827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18376627938871785827.bin' '-l' '-1' '-v' '-w' '/tmp/graph18376627938871785827.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:52:40] [INFO ] Decomposing Gal with order
[2025-05-30 01:52:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:52:40] [INFO ] Removed a total of 1478 redundant transitions.
[2025-05-30 01:52:40] [INFO ] Flatten gal took : 116 ms
[2025-05-30 01:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 30 ms.
[2025-05-30 01:52:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12047087664780242540.gal : 11 ms
[2025-05-30 01:52:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13747384776010846234.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/ReachabilityCardinality12047087664780242540.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13747384776010846234.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/ReachabilityCardinality13747384776010846234.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 117
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :117 after 2093
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2093 after 2733
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2733 after 285867
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :483501 after 1.454e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7.86568e+06 after 1.15318e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.12633e+07 after 2.17903e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32276 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 01:52:55] [INFO ] Flatten gal took : 45 ms
[2025-05-30 01:52:55] [INFO ] Applying decomposition
[2025-05-30 01:52:55] [INFO ] Flatten gal took : 41 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/graph6916450027613009684.txt' '-o' '/tmp/graph6916450027613009684.bin' '-w' '/tmp/graph6916450027613009684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6916450027613009684.bin' '-l' '-1' '-v' '-w' '/tmp/graph6916450027613009684.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:52:55] [INFO ] Decomposing Gal with order
[2025-05-30 01:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:52:56] [INFO ] Removed a total of 1313 redundant transitions.
[2025-05-30 01:52:56] [INFO ] Flatten gal took : 79 ms
[2025-05-30 01:52:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 28 ms.
[2025-05-30 01:52:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2052808185291981989.gal : 12 ms
[2025-05-30 01:52:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12527022935891253201.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/ReachabilityCardinality2052808185291981989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12527022935891253201.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12527022935891253201.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 74495
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :74495 after 909857
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :909857 after 2.79867e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9.22623e+14 after 1.20684e+15
Detected timeout of ITS tools.
[2025-05-30 02:22:56] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2813544625176282329
[2025-05-30 02:22:56] [INFO ] Applying decomposition
[2025-05-30 02:22:56] [INFO ] Computing symmetric may disable matrix : 788 transitions.
[2025-05-30 02:22:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:22:56] [INFO ] Computing symmetric may enable matrix : 788 transitions.
[2025-05-30 02:22:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:22:56] [INFO ] Flatten gal took : 24 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/graph2707327731368818157.txt' '-o' '/tmp/graph2707327731368818157.bin' '-w' '/tmp/graph2707327731368818157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2707327731368818157.bin' '-l' '-1' '-v' '-w' '/tmp/graph2707327731368818157.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:22:56] [INFO ] Decomposing Gal with order
[2025-05-30 02:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:22:56] [INFO ] Removed a total of 1522 redundant transitions.
[2025-05-30 02:22:56] [INFO ] Flatten gal took : 44 ms
[2025-05-30 02:22:56] [INFO ] Computing Do-Not-Accords matrix : 788 transitions.
[2025-05-30 02:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 12 ms.
[2025-05-30 02:22:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16974195259200084800.gal : 5 ms
[2025-05-30 02:22:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18193153796898089797.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/ReachabilityCardinality16974195259200084800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18193153796898089797.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
[2025-05-30 02:22:56] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:22:56] [INFO ] Built C files in 212ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2813544625176282329
Running compilation step : cd /tmp/ltsmin2813544625176282329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality18193153796898089797.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1197
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1197 after 6301
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6301 after 1.01505e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.01505e+06 after 8.84337e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.84337e+06 after 1.31284e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.03784e+07 after 6.80611e+07
Compilation finished in 2239 ms.
Running link step : cd /tmp/ltsmin2813544625176282329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin2813544625176282329;'/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' 'ASLinkPT02bReachabilityCardinality202504==true'
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.5088e+08 after 2.12162e+08
Invariant property ASLink-PT-02b-ReachabilityCardinality-2025-04 does not hold.
FORMULA ASLink-PT-02b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.50838e+10,74.3576,878624,15458,2100,1.36283e+06,67925,1371,2.66942e+06,222,514346,0
Total reachable state count : 15083802516
Verifying 1 reachability properties.
Invariant property ASLink-PT-02b-ReachabilityCardinality-2025-04 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-02b-ReachabilityCardinality-2025-04,6456,80.7877,878624,463,132,1.36283e+06,67925,1526,2.66942e+06,237,514346,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2107534 ms.
BK_STOP 1748571955044
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-02b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729000310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;