Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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 669K 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-04b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-00
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-01
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-02
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-05
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-06
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-07
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-08
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-09
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-10
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-11
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-12
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-13
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-14
FORMULA_NAME ASLink-PT-04b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748580041829

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 04:40:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 04:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 04:40:43] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2025-05-30 04:40:43] [INFO ] Transformed 2034 places.
[2025-05-30 04:40:43] [INFO ] Transformed 2567 transitions.
[2025-05-30 04:40:43] [INFO ] Found NUPN structural information;
[2025-05-30 04:40:43] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (90 resets) in 1721 ms. (23 steps per ms) remains 12/16 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 508 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
[2025-05-30 04:40:44] [INFO ] Flatten gal took : 378 ms
BEST_FIRST walk for 40004 steps (13 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (11 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
[2025-05-30 04:40:44] [INFO ] Flatten gal took : 246 ms
BEST_FIRST walk for 40004 steps (13 resets) in 338 ms. (118 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (14 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
[2025-05-30 04:40:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13000229486639694711.gal : 118 ms
BEST_FIRST walk for 40003 steps (18 resets) in 184 ms. (216 steps per ms) remains 12/12 properties
[2025-05-30 04:40:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11893496117464032943.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/ReachabilityCardinality13000229486639694711.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11893496117464032943.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (13 resets) in 184 ms. (216 steps per ms) remains 12/12 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40002 steps (11 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (15 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
// Phase 1: matrix 2567 rows 2034 cols
[2025-05-30 04:40:45] [INFO ] Computed 199 invariants in 96 ms
Loading property file /tmp/ReachabilityCardinality11893496117464032943.prop.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 415/621 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 415/657 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 83/704 variables, 12/669 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/704 variables, 83/752 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/704 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1294/1998 variables, 147/899 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1998 variables, 1294/2193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :16 after 49
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :416 after 569
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :569 after 15361
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :15361 after 618139
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :618139 after 5.45975e+08
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :5.45975e+08 after 3.89853e+11
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :3.89853e+11 after 3.51941e+17
At refinement iteration 10 (INCLUDED_ONLY) 0/1998 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 36/2034 variables, 4/2197 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5234ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 206 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 311 place count 2034 transition count 2256
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 318 rules applied. Total rules applied 629 place count 1723 transition count 2249
Reduce places removed 1 places and 0 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Iterating post reduction 2 with 50 rules applied. Total rules applied 679 place count 1722 transition count 2200
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 730 place count 1673 transition count 2198
Performed 417 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 417 Pre rules applied. Total rules applied 730 place count 1673 transition count 1781
Deduced a syphon composed of 417 places in 4 ms
Ensure Unique test removed 32 places
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 4 with 866 rules applied. Total rules applied 1596 place count 1224 transition count 1781
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 4 with 24 rules applied. Total rules applied 1620 place count 1219 transition count 1762
Reduce places removed 19 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 24 rules applied. Total rules applied 1644 place count 1200 transition count 1757
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1649 place count 1195 transition count 1757
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1649 place count 1195 transition count 1748
Deduced a syphon composed of 9 places in 8 ms
Ensure Unique test removed 4 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1671 place count 1182 transition count 1748
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1672 place count 1181 transition count 1748
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 1672 place count 1181 transition count 1744
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1680 place count 1177 transition count 1744
Discarding 67 places :
Symmetric choice reduction at 8 with 67 rule applications. Total rules 1747 place count 1110 transition count 1677
Iterating global reduction 8 with 67 rules applied. Total rules applied 1814 place count 1110 transition count 1677
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 8 with 7 rules applied. Total rules applied 1821 place count 1109 transition count 1671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1822 place count 1108 transition count 1671
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 1822 place count 1108 transition count 1655
Deduced a syphon composed of 16 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 33 rules applied. Total rules applied 1855 place count 1091 transition count 1655
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1860 place count 1086 transition count 1622
Iterating global reduction 10 with 5 rules applied. Total rules applied 1865 place count 1086 transition count 1622
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 1865 place count 1086 transition count 1620
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1869 place count 1084 transition count 1620
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 10 with 172 rules applied. Total rules applied 2041 place count 998 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2042 place count 997 transition count 1533
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 2044 place count 996 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2045 place count 995 transition count 1532
Iterating global reduction 10 with 1 rules applied. Total rules applied 2046 place count 995 transition count 1532
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 10 with 2 rules applied. Total rules applied 2048 place count 995 transition count 1530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2049 place count 994 transition count 1530
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 2051 place count 994 transition count 1528
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 2053 place count 993 transition count 1527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2054 place count 992 transition count 1527
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 2060 place count 992 transition count 1521
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2066 place count 986 transition count 1521
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 2069 place count 986 transition count 1518
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 2072 place count 983 transition count 1518
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 2076 place count 983 transition count 1518
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2077 place count 982 transition count 1517
Reduce places removed 3 places and 0 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 16 with 4 rules applied. Total rules applied 2081 place count 979 transition count 1516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2082 place count 978 transition count 1516
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 5 Pre rules applied. Total rules applied 2082 place count 978 transition count 1511
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 2092 place count 973 transition count 1511
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 18 with 2 rules applied. Total rules applied 2094 place count 971 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2095 place count 970 transition count 1510
Iterating global reduction 19 with 1 rules applied. Total rules applied 2096 place count 970 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2097 place count 969 transition count 1509
Iterating global reduction 19 with 1 rules applied. Total rules applied 2098 place count 969 transition count 1509
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 2102 place count 967 transition count 1507
Applied a total of 2102 rules in 1126 ms. Remains 967 /2034 variables (removed 1067) and now considering 1507/2567 (removed 1060) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1139 ms. Remains : 967/2034 places, 1507/2567 transitions.
RANDOM walk for 40000 steps (207 resets) in 503 ms. (79 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 388 ms. (102 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (42 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 233 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (42 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (43 resets) in 119 ms. (333 steps per ms) remains 11/12 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (42 resets) in 259 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (43 resets) in 136 ms. (292 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (47 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (43 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (48 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (48 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :3.51941e+17 after 5.54986e+23
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :5.54986e+23 after 5.70061e+25
Interrupted probabilistic random walk after 232170 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 11
Probabilistic random walk after 232170 steps, saw 65184 distinct states, run finished after 3005 ms. (steps per millisecond=77 ) properties seen :0
// Phase 1: matrix 1507 rows 967 cols
[2025-05-30 04:40:55] [INFO ] Computed 148 invariants in 25 ms
[2025-05-30 04:40:55] [INFO ] State equation strengthened by 7 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/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 222/377 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 17/394 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 558/952 variables, 111/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 15/967 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/967 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1507/2474 variables, 967/1115 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2474 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2474 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/2474 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2474/2474 variables, and 1122 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4562 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 967/967 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 222/377 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 17/394 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 558/952 variables, 111/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:00] [INFO ] Deduced a trap composed of 26 places in 337 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:01] [INFO ] Deduced a trap composed of 112 places in 478 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :5.70061e+25 after 6.37066e+25
[2025-05-30 04:41:01] [INFO ] Deduced a trap composed of 32 places in 363 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:02] [INFO ] Deduced a trap composed of 112 places in 384 ms of which 97 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 15/967 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:05] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/967 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2025-02 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2025-05 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2025-09 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityFireability-2025-12 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 1507/2474 variables, 967/1120 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2474 variables, 7/1127 constraints. Problems are: Problem set: 4 solved, 7 unsolved
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :6.37066e+25 after 7.19464e+25
At refinement iteration 13 (INCLUDED_ONLY) 0/2474 variables, 5/1132 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:28] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:30] [INFO ] Deduced a trap composed of 34 places in 411 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:31] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:31] [INFO ] Deduced a trap composed of 70 places in 391 ms of which 70 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2474 variables, 4/1136 constraints. Problems are: Problem set: 4 solved, 7 unsolved
SDD proceeding with computation,12 properties remain. new max is 262144
SDD size :7.19464e+25 after 1.05181e+26
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2474/2474 variables, and 1136 constraints, problems are : Problem set: 4 solved, 7 unsolved in 45037 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 117/117 constraints, State Equation: 967/967 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49691ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 150 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 1507/1507 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 967 transition count 1498
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 958 transition count 1496
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 956 transition count 1496
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 22 place count 956 transition count 1469
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 79 place count 926 transition count 1469
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 79 place count 926 transition count 1466
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 86 place count 922 transition count 1466
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 921 transition count 1465
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 921 transition count 1465
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 110 place count 910 transition count 1454
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 910 transition count 1451
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 907 transition count 1451
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 905 transition count 1449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 904 transition count 1449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 119 place count 904 transition count 1447
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 5 with 5 rules applied. Total rules applied 124 place count 901 transition count 1447
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 126 place count 899 transition count 1447
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 899 transition count 1446
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 898 transition count 1446
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 132 place count 896 transition count 1444
Applied a total of 132 rules in 206 ms. Remains 896 /967 variables (removed 71) and now considering 1444/1507 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 896/967 places, 1444/1507 transitions.
RANDOM walk for 40000 steps (226 resets) in 685 ms. (58 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (62 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 245 ms. (162 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (52 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 333099 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 7
Probabilistic random walk after 333099 steps, saw 67697 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 1444 rows 896 cols
[2025-05-30 04:41:48] [INFO ] Computed 140 invariants in 17 ms
[2025-05-30 04:41:48] [INFO ] State equation strengthened by 2 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/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 198/348 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 5/353 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 529/882 variables, 106/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/884 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 12/896 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/896 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1444/2340 variables, 896/1036 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2340 variables, 2/1038 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2340 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2340/2340 variables, and 1038 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3324 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 896/896 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 198/348 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 5/353 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 529/882 variables, 106/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:52] [INFO ] Deduced a trap composed of 107 places in 365 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:53] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:41:53] [INFO ] Deduced a trap composed of 107 places in 385 ms of which 95 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/884 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 12/896 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/896 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1444/2340 variables, 896/1039 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2340 variables, 2/1041 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2340 variables, 5/1046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2340 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/2340 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2340/2340 variables, and 1046 constraints, problems are : Problem set: 0 solved, 7 unsolved in 22109 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 896/896 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25496ms problems are : Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,12 properties remain. new max is 524288
SDD size :1.05181e+26 after 6.41877e+26
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30459 ms.
Support contains 149 out of 896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 896/896 places, 1444/1444 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 896 transition count 1443
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 895 transition count 1443
Applied a total of 2 rules in 47 ms. Remains 895 /896 variables (removed 1) and now considering 1443/1444 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 895/896 places, 1443/1444 transitions.
RANDOM walk for 40000 steps (236 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (44 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (52 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 326451 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 6
Probabilistic random walk after 326451 steps, saw 66467 distinct states, run finished after 3003 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 1443 rows 895 cols
[2025-05-30 04:42:48] [INFO ] Computed 140 invariants in 11 ms
[2025-05-30 04:42:48] [INFO ] State equation strengthened by 2 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/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 220/369 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/374 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 508/882 variables, 105/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/884 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/884 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 11/895 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1443/2338 variables, 895/1035 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2338 variables, 2/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2338 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/2338 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2338/2338 variables, and 1037 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3519 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 895/895 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 220/369 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/374 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 508/882 variables, 105/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:42:52] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 38 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/884 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:42:53] [INFO ] Deduced a trap composed of 100 places in 398 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:42:54] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 44 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/884 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 11/895 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/895 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1443/2338 variables, 895/1038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2338 variables, 2/1040 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2338 variables, 4/1044 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:42:59] [INFO ] Deduced a trap composed of 94 places in 397 ms of which 90 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2338 variables, 1/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2338 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/2338 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2338/2338 variables, and 1045 constraints, problems are : Problem set: 0 solved, 6 unsolved in 14367 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 895/895 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17928ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 11173 ms.
Support contains 136 out of 895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 895/895 places, 1443/1443 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 895 transition count 1441
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 893 transition count 1440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 892 transition count 1440
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 892 transition count 1437
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 889 transition count 1437
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 888 transition count 1436
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 888 transition count 1436
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 23 place count 883 transition count 1432
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 3 with 2 rules applied. Total rules applied 25 place count 883 transition count 1430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 882 transition count 1430
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 27 place count 881 transition count 1429
Iterating global reduction 5 with 1 rules applied. Total rules applied 28 place count 881 transition count 1429
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 29 place count 880 transition count 1428
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 880 transition count 1428
Applied a total of 30 rules in 108 ms. Remains 880 /895 variables (removed 15) and now considering 1428/1443 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 880/895 places, 1428/1443 transitions.
RANDOM walk for 40000 steps (245 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (62 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (54 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 347487 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 4
Probabilistic random walk after 347487 steps, saw 70103 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1428 rows 880 cols
[2025-05-30 04:43:20] [INFO ] Computed 139 invariants in 12 ms
[2025-05-30 04:43:20] [INFO ] State equation strengthened by 4 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/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 230/366 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/371 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 495/866 variables, 102/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/868 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/868 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 12/880 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/880 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1428/2308 variables, 880/1019 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2308 variables, 4/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2308 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2308 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2308/2308 variables, and 1023 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 880/880 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/2 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 230/366 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/371 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 495/866 variables, 102/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:43:23] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/868 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 12/880 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/880 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1428/2308 variables, 880/1020 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2308 variables, 4/1024 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2308 variables, 2/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2308 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2308 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2308/2308 variables, and 1026 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7484 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 107/107 constraints, State Equation: 880/880 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10001ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 7281 ms.
Support contains 136 out of 880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 1428/1428 transitions.
Applied a total of 0 rules in 25 ms. Remains 880 /880 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 880/880 places, 1428/1428 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 1428/1428 transitions.
Applied a total of 0 rules in 24 ms. Remains 880 /880 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2025-05-30 04:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:43:38] [INFO ] Implicit Places using invariants in 663 ms returned [27, 44, 81, 162, 163, 175, 184, 185, 186, 189, 211, 229, 253, 275, 276, 326, 343, 344, 345, 349, 369, 389, 449, 482, 486, 487, 501, 510, 637, 648, 649, 671, 687, 734, 754, 756, 777, 783, 789, 801, 807, 814, 821, 827, 833, 839, 879]
[2025-05-30 04:43:38] [INFO ] Actually due to overlaps returned [211, 369, 510, 734, 44, 189, 349, 185, 345, 501, 687, 879, 186, 754, 27, 326, 486, 487, 81, 184, 343, 389, 807, 827, 175, 229, 253, 275, 344, 449, 637, 648, 671, 756, 777, 783, 789, 801, 814, 821, 833, 839]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 676 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 838/880 places, 1428/1428 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 837 transition count 1388
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 47 rules applied. Total rules applied 88 place count 797 transition count 1381
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 791 transition count 1381
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 94 place count 791 transition count 1374
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 108 place count 784 transition count 1374
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 119 place count 773 transition count 1363
Iterating global reduction 3 with 11 rules applied. Total rules applied 130 place count 773 transition count 1363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 130 place count 773 transition count 1362
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 132 place count 772 transition count 1362
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 768 transition count 1358
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 768 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 767 transition count 1357
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 767 transition count 1357
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 208 place count 734 transition count 1324
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 210 place count 732 transition count 1322
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 732 transition count 1322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 732 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 214 place count 731 transition count 1320
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 731 transition count 1320
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 230 place count 731 transition count 1305
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 245 place count 716 transition count 1305
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 716 transition count 1304
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 251 place count 716 transition count 1304
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 256 place count 716 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 257 place count 715 transition count 1303
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 715 transition count 1303
Applied a total of 258 rules in 295 ms. Remains 715 /838 variables (removed 123) and now considering 1303/1428 (removed 125) transitions.
// Phase 1: matrix 1303 rows 715 cols
[2025-05-30 04:43:38] [INFO ] Computed 96 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:43:39] [INFO ] Implicit Places using invariants in 449 ms returned [123, 131, 142, 143, 233, 254, 280, 281, 344, 384, 541]
[2025-05-30 04:43:39] [INFO ] Actually due to overlaps returned [280, 281, 142, 123, 131, 233, 254, 344, 384, 541]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 456 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 705/880 places, 1303/1428 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 704 transition count 1302
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 704 transition count 1302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 702 transition count 1300
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 702 transition count 1298
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 700 transition count 1298
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 700 transition count 1297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 699 transition count 1297
Applied a total of 12 rules in 75 ms. Remains 699 /705 variables (removed 6) and now considering 1297/1303 (removed 6) transitions.
// Phase 1: matrix 1297 rows 699 cols
[2025-05-30 04:43:39] [INFO ] Computed 86 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:43:39] [INFO ] Implicit Places using invariants in 438 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 440 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 698/880 places, 1297/1428 transitions.
Applied a total of 0 rules in 19 ms. Remains 698 /698 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1986 ms. Remains : 698/880 places, 1297/1428 transitions.
RANDOM walk for 40000 steps (277 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (56 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (57 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (61 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 399635 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 4
Probabilistic random walk after 399635 steps, saw 75632 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 1297 rows 698 cols
[2025-05-30 04:43:43] [INFO ] Computed 85 invariants in 9 ms
[2025-05-30 04:43:43] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 177/313 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/314 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 383/697 variables, 63/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/698 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1297/1995 variables, 698/783 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1995 variables, 8/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1995 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1995 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1995/1995 variables, and 791 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2041 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 698/698 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/2 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 177/313 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/314 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:43:45] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 383/697 variables, 63/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/697 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/698 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:43:46] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1297/1995 variables, 698/785 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1995 variables, 8/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1995 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:43:47] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 38 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1995 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1995 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1995 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1995/1995 variables, and 796 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 698/698 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5773ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 6065 ms.
Support contains 136 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1297/1297 transitions.
Applied a total of 0 rules in 16 ms. Remains 698 /698 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 698/698 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1297/1297 transitions.
Applied a total of 0 rules in 15 ms. Remains 698 /698 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2025-05-30 04:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:43:55] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-05-30 04:43:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:43:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 04:43:57] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 2634 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 04:43:57] [INFO ] Redundant transitions in 91 ms returned []
Running 1287 sub problems to find dead transitions.
[2025-05-30 04:43:57] [INFO ] Invariant cache hit.
[2025-05-30 04:43:57] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,12 properties remain. new max is 1048576
SDD size :6.41877e+26 after 2.82867e+27
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 692/1995 variables, and 61 constraints, problems are : Problem set: 0 solved, 1287 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, Generalized P Invariants (flows): 57/65 constraints, State Equation: 0/698 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1287/1287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1287 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 1287 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0)
(s2 0)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 1)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 2)
(s103 1)
(s104 0)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 3)
(s122 1)
(s123 1)
(s124 1)
(s125 0)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 4)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 17)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 16)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 692/1995 variables, and 61 constraints, problems are : Problem set: 0 solved, 1287 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, Generalized P Invariants (flows): 57/65 constraints, State Equation: 0/698 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/1287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 1287 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63283 ms. Remains : 698/698 places, 1297/1297 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 698 transition count 1296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 697 transition count 1296
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 697 transition count 1291
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 13 place count 691 transition count 1291
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 688 transition count 1291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 686 transition count 1289
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 686 transition count 1289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 684 transition count 1287
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 684 transition count 1287
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 682 transition count 1285
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 682 transition count 1285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 682 transition count 1284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 681 transition count 1283
Applied a total of 31 rules in 64 ms. Remains 681 /698 variables (removed 17) and now considering 1283/1297 (removed 14) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1283 rows 681 cols
[2025-05-30 04:44:58] [INFO ] Computed 81 invariants in 16 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 04:44:58] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 04:44:58] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2025-05-30 04:44:58] [INFO ] [Nat]Absence check using 22 positive and 59 generalized place invariants in 16 ms returned sat
[2025-05-30 04:45:00] [INFO ] After 1826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-05-30 04:45:02] [INFO ] After 3796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-05-30 04:45:03] [INFO ] After 4665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-05-30 04:45:03] [INFO ] Flatten gal took : 57 ms
[2025-05-30 04:45:03] [INFO ] Flatten gal took : 48 ms
[2025-05-30 04:45:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6629513237500589472.gal : 20 ms
[2025-05-30 04:45:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8005647349783477323.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/ReachabilityCardinality6629513237500589472.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8005647349783477323.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8005647349783477323.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 28
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :28 after 70
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :70 after 446
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :446 after 2902
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2902 after 772858
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :772858 after 1.37795e+09
Invariant property ASLink-PT-04b-ReachabilityFireability-2025-15 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.37795e+09 after 2.99773e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.99773e+10 after 2.99778e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.99778e+10 after 3.66704e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.66704e+10 after 5.97139e+10
Detected timeout of ITS tools.
[2025-05-30 04:45:18] [INFO ] Flatten gal took : 42 ms
[2025-05-30 04:45:18] [INFO ] Applying decomposition
[2025-05-30 04:45:18] [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/graph1217844666875857261.txt' '-o' '/tmp/graph1217844666875857261.bin' '-w' '/tmp/graph1217844666875857261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1217844666875857261.bin' '-l' '-1' '-v' '-w' '/tmp/graph1217844666875857261.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:45:18] [INFO ] Decomposing Gal with order
[2025-05-30 04:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:45:18] [INFO ] Removed a total of 2079 redundant transitions.
[2025-05-30 04:45:19] [INFO ] Flatten gal took : 167 ms
[2025-05-30 04:45:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 38 ms.
[2025-05-30 04:45:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11992816828551417287.gal : 19 ms
[2025-05-30 04:45:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11179844549741243927.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/ReachabilityCardinality11992816828551417287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11179844549741243927.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/ReachabilityCardinality11179844549741243927.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :10 after 4082
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :4082 after 333670
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :333670 after 6.75195e+10
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.72921e+11 after 1.73811e+11
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.73811e+11 after 2.53343e+12
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.53343e+12 after 2.89063e+12
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 35978 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 04:45:34] [INFO ] Flatten gal took : 65 ms
[2025-05-30 04:45:34] [INFO ] Applying decomposition
[2025-05-30 04:45:34] [INFO ] Flatten gal took : 75 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/graph14282514838747286030.txt' '-o' '/tmp/graph14282514838747286030.bin' '-w' '/tmp/graph14282514838747286030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14282514838747286030.bin' '-l' '-1' '-v' '-w' '/tmp/graph14282514838747286030.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:45:34] [INFO ] Decomposing Gal with order
[2025-05-30 04:45:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:45:35] [INFO ] Removed a total of 1937 redundant transitions.
[2025-05-30 04:45:35] [INFO ] Flatten gal took : 143 ms
[2025-05-30 04:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 43 ms.
[2025-05-30 04:45:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11978291670143137437.gal : 19 ms
[2025-05-30 04:45:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11934992445067641076.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/ReachabilityCardinality11978291670143137437.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11934992445067641076.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/ReachabilityCardinality11934992445067641076.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 4.37975e+16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :4.37975e+16 after 2.89649e+22
Invariant property ASLink-PT-04b-ReachabilityFireability-2025-15 does not hold.
FORMULA ASLink-PT-04b-ReachabilityFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2025-05-30 05:15:35] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16481604968631170593
[2025-05-30 05:15:35] [INFO ] Computing symmetric may disable matrix : 1297 transitions.
[2025-05-30 05:15:35] [INFO ] Applying decomposition
[2025-05-30 05:15:35] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:15:35] [INFO ] Computing symmetric may enable matrix : 1297 transitions.
[2025-05-30 05:15:35] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 05:15:35] [INFO ] Flatten gal took : 78 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/graph337700091525528491.txt' '-o' '/tmp/graph337700091525528491.bin' '-w' '/tmp/graph337700091525528491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph337700091525528491.bin' '-l' '-1' '-v' '-w' '/tmp/graph337700091525528491.weights' '-q' '0' '-e' '0.001'
[2025-05-30 05:15:35] [INFO ] Decomposing Gal with order
[2025-05-30 05:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 05:15:35] [INFO ] Removed a total of 2067 redundant transitions.
[2025-05-30 05:15:35] [INFO ] Flatten gal took : 56 ms
[2025-05-30 05:15:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 13 ms.
[2025-05-30 05:15:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4082932754028499042.gal : 8 ms
[2025-05-30 05:15:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6122842859158731229.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/ReachabilityFireability4082932754028499042.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6122842859158731229.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability6122842859158731229.prop.
[2025-05-30 05:15:35] [INFO ] Computing Do-Not-Accords matrix : 1297 transitions.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 28
[2025-05-30 05:15:35] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :28 after 70
[2025-05-30 05:15:35] [INFO ] Built C files in 503ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16481604968631170593
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :70 after 136750
Running compilation step : cd /tmp/ltsmin16481604968631170593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :136750 after 772858
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.49033e+11 after 1.73804e+11
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.73804e+11 after 2.34241e+11
Compilation finished in 4541 ms.
Running link step : cd /tmp/ltsmin16481604968631170593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 169 ms.
Running LTSmin : cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202303==true'
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :2.34241e+11 after 1.14348e+13
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202303==true'
Running LTSmin : cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202404==true'
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202506==true'
Invariant property ASLink-PT-04b-ReachabilityFireability-2023-03 does not hold.
FORMULA ASLink-PT-04b-ReachabilityFireability-2023-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.40405e+14 after 6.78306e+14
WARNING : LTSmin timed out (>300 s) on command cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202506==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin16481604968631170593;'/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' 'ASLinkPT04bReachabilityFireability202404==true'
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.78306e+14 after 1.13547e+15

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;