About the Execution of ITS-Tools for ASLink-PT-05b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ???FFFTT?FTFTF?F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729100358.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-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729100358
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 4.0K 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.2K 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 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 795K 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-05b-ReachabilityCardinality-2023-03
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-00
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-01
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-02
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-04
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-05
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-06
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-07
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-08
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-10
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-11
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-12
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-13
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-14
FORMULA_NAME ASLink-PT-05b-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748584790701
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 05:59:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 05:59:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:59:52] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2025-05-30 05:59:52] [INFO ] Transformed 2430 places.
[2025-05-30 05:59:52] [INFO ] Transformed 3040 transitions.
[2025-05-30 05:59:52] [INFO ] Found NUPN structural information;
[2025-05-30 05:59:52] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (81 resets) in 1989 ms. (20 steps per ms) remains 10/13 properties
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (10 resets) in 440 ms. (90 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (10 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
[2025-05-30 05:59:53] [INFO ] Flatten gal took : 490 ms
BEST_FIRST walk for 40003 steps (10 resets) in 1186 ms. (33 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
[2025-05-30 05:59:53] [INFO ] Flatten gal took : 251 ms
BEST_FIRST walk for 40004 steps (11 resets) in 248 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
[2025-05-30 05:59:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3538199223506153973.gal : 114 ms
[2025-05-30 05:59:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6887411070374593276.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3538199223506153973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6887411070374593276.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (9 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 134 ms. (296 steps per ms) remains 10/10 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 ...328
BEST_FIRST walk for 40004 steps (10 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
// Phase 1: matrix 3040 rows 2430 cols
[2025-05-30 05:59:54] [INFO ] Computed 238 invariants in 91 ms
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality6887411070374593276.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 433/583 variables, 39/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 433/622 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 149/732 variables, 17/639 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 149/788 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ASLink-PT-05b-ReachabilityCardinality-2025-04 is UNSAT
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1638/2370 variables, 174/962 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2370 variables, 1638/2600 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :11 after 17
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :17 after 136
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :136 after 246
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :246 after 699
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :699 after 13547
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :13547 after 223559
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :223559 after 906890
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :906890 after 7.2729e+10
At refinement iteration 10 (INCLUDED_ONLY) 0/2370 variables, 0/2600 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 60/2430 variables, 8/2608 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SMT process timed out in 5238ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 129 out of 2430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 474 place count 2430 transition count 2566
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 500 rules applied. Total rules applied 974 place count 1956 transition count 2540
Reduce places removed 7 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 36 rules applied. Total rules applied 1010 place count 1949 transition count 2511
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 1039 place count 1920 transition count 2511
Performed 507 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 507 Pre rules applied. Total rules applied 1039 place count 1920 transition count 2004
Deduced a syphon composed of 507 places in 38 ms
Ensure Unique test removed 39 places
Reduce places removed 546 places and 0 transitions.
Iterating global reduction 4 with 1053 rules applied. Total rules applied 2092 place count 1374 transition count 2004
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 31 rules applied. Total rules applied 2123 place count 1365 transition count 1982
Reduce places removed 22 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 27 rules applied. Total rules applied 2150 place count 1343 transition count 1977
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2155 place count 1338 transition count 1977
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 2155 place count 1338 transition count 1967
Deduced a syphon composed of 10 places in 6 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 2183 place count 1320 transition count 1967
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2185 place count 1319 transition count 1966
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2186 place count 1318 transition count 1966
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2186 place count 1318 transition count 1957
Deduced a syphon composed of 9 places in 11 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2204 place count 1309 transition count 1957
Discarding 68 places :
Symmetric choice reduction at 9 with 68 rule applications. Total rules 2272 place count 1241 transition count 1889
Iterating global reduction 9 with 68 rules applied. Total rules applied 2340 place count 1241 transition count 1889
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2341 place count 1241 transition count 1888
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 20 Pre rules applied. Total rules applied 2341 place count 1241 transition count 1868
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 41 rules applied. Total rules applied 2382 place count 1220 transition count 1868
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2382 place count 1220 transition count 1867
Deduced a syphon composed of 1 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2385 place count 1218 transition count 1867
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 2390 place count 1213 transition count 1834
Iterating global reduction 10 with 5 rules applied. Total rules applied 2395 place count 1213 transition count 1834
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2395 place count 1213 transition count 1833
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2397 place count 1212 transition count 1833
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 8 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 10 with 285 rules applied. Total rules applied 2682 place count 1068 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2683 place count 1067 transition count 1691
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 2685 place count 1066 transition count 1691
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 2686 place count 1065 transition count 1690
Iterating global reduction 10 with 1 rules applied. Total rules applied 2687 place count 1065 transition count 1690
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 2689 place count 1065 transition count 1688
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2690 place count 1064 transition count 1688
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2692 place count 1063 transition count 1697
Free-agglomeration rule applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 2702 place count 1063 transition count 1687
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 2712 place count 1053 transition count 1687
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 13 with 7 rules applied. Total rules applied 2719 place count 1053 transition count 1680
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 2726 place count 1046 transition count 1680
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2727 place count 1046 transition count 1680
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 2728 place count 1046 transition count 1680
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2729 place count 1045 transition count 1679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2730 place count 1044 transition count 1679
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2730 place count 1044 transition count 1678
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2732 place count 1043 transition count 1678
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 15 with 1 rules applied. Total rules applied 2733 place count 1042 transition count 1678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2737 place count 1040 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2738 place count 1039 transition count 1675
Iterating global reduction 16 with 1 rules applied. Total rules applied 2739 place count 1039 transition count 1675
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2740 place count 1039 transition count 1674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2741 place count 1038 transition count 1674
Applied a total of 2741 rules in 1444 ms. Remains 1038 /2430 variables (removed 1392) and now considering 1674/3040 (removed 1366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1458 ms. Remains : 1038/2430 places, 1674/3040 transitions.
RANDOM walk for 40000 steps (230 resets) in 874 ms. (45 steps per ms) remains 7/9 properties
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (45 resets) in 291 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (41 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (43 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (43 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (44 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
// Phase 1: matrix 1674 rows 1038 cols
[2025-05-30 06:00:01] [INFO ] Computed 173 invariants in 29 ms
[2025-05-30 06:00:01] [INFO ] State equation strengthened by 10 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 301/425 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 36/461 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 549/1010 variables, 122/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/1012 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1012 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 26/1038 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1674/2712 variables, 1038/1211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2712 variables, 10/1221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2712 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2712 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2712/2712 variables, and 1221 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3589 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 127/127 constraints, State Equation: 1038/1038 constraints, ReadFeed: 10/10 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 301/425 variables, 33/33 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 06:00:05] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 36/461 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 549/1010 variables, 122/167 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 06:00:06] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:06] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:06] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:06] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:06] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:07] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1010 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2/1012 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 26/1038 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1038 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1674/2712 variables, 1038/1218 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2712 variables, 10/1228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2712 variables, 5/1233 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 06:00:29] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 18 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2712 variables, 1/1234 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 06:00:47] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 40 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2712 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2712/2712 variables, and 1235 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 127/127 constraints, State Equation: 1038/1038 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48686ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 1674/1674 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1038 transition count 1673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1037 transition count 1673
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 1037 transition count 1669
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 1033 transition count 1669
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 1031 transition count 1667
Applied a total of 14 rules in 101 ms. Remains 1031 /1038 variables (removed 7) and now considering 1667/1674 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 1031/1038 places, 1667/1674 transitions.
RANDOM walk for 40000 steps (254 resets) in 581 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (42 resets) in 168 ms. (236 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (41 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (43 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (37 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 144219 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 7
Probabilistic random walk after 144219 steps, saw 56976 distinct states, run finished after 3007 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 1667 rows 1031 cols
[2025-05-30 06:00:53] [INFO ] Computed 173 invariants in 17 ms
[2025-05-30 06:00:53] [INFO ] State equation strengthened by 10 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 300/424 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 31/455 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 546/1001 variables, 122/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/1004 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1004 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 27/1031 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1031 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1667/2698 variables, 1031/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2698 variables, 10/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2698 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2698 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2698/2698 variables, and 1214 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3354 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1031/1031 constraints, ReadFeed: 10/10 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 300/424 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 31/455 variables, 10/42 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 06:00:57] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 546/1001 variables, 122/165 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 06:00:58] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:58] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:58] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:58] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:58] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:00:59] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1001 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1001 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/1004 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1004 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 27/1031 variables, 6/180 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 06:01:00] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1031 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1031 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1667/2698 variables, 1031/1212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2698 variables, 10/1222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2698 variables, 5/1227 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 06:01:12] [INFO ] Deduced a trap along path composed of 18 places in 64 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2698 variables, 1/1228 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 06:01:23] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 28 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2698 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2698 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/2698 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2698/2698 variables, and 1229 constraints, problems are : Problem set: 0 solved, 7 unsolved in 31171 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1031/1031 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34592ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 34714 ms.
Support contains 124 out of 1031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 1667/1667 transitions.
Applied a total of 0 rules in 37 ms. Remains 1031 /1031 variables (removed 0) and now considering 1667/1667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1031/1031 places, 1667/1667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 1667/1667 transitions.
Applied a total of 0 rules in 37 ms. Remains 1031 /1031 variables (removed 0) and now considering 1667/1667 (removed 0) transitions.
[2025-05-30 06:02:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:02:04] [INFO ] Implicit Places using invariants in 832 ms returned [1, 19, 20, 52, 70, 118, 119, 138, 154, 166, 178, 195, 201, 228, 246, 293, 294, 311, 359, 362, 363, 365, 385, 467, 477, 499, 516, 517, 521, 542, 561, 621, 649, 683, 684, 687, 706, 726, 813, 833, 847, 848, 849, 885, 892, 910, 911, 912, 913, 931, 937, 943, 949, 956, 963, 969, 975, 981, 988, 994]
[2025-05-30 06:02:04] [INFO ] Actually due to overlaps returned [885, 849, 52, 228, 385, 542, 687, 706, 892, 521, 362, 365, 516, 683, 847, 910, 201, 363, 517, 684, 848, 911, 1, 19, 499, 70, 195, 246, 359, 561, 726, 912, 963, 981, 994, 20, 118, 138, 154, 166, 178, 833, 913, 931, 937, 943, 949, 956, 969, 975, 988]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 845 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 980/1031 places, 1667/1667 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 976 transition count 1608
Reduce places removed 59 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 74 rules applied. Total rules applied 137 place count 917 transition count 1593
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 152 place count 902 transition count 1593
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 152 place count 902 transition count 1567
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 205 place count 875 transition count 1567
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 212 place count 871 transition count 1564
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 218 place count 868 transition count 1561
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 865 transition count 1561
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 231 place count 855 transition count 1551
Iterating global reduction 6 with 10 rules applied. Total rules applied 241 place count 855 transition count 1551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 243 place count 855 transition count 1549
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 246 place count 852 transition count 1545
Iterating global reduction 7 with 3 rules applied. Total rules applied 249 place count 852 transition count 1545
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 325 place count 814 transition count 1507
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 326 place count 813 transition count 1506
Iterating global reduction 7 with 1 rules applied. Total rules applied 327 place count 813 transition count 1506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 329 place count 812 transition count 1506
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 330 place count 812 transition count 1505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 331 place count 811 transition count 1505
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 354 place count 811 transition count 1482
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 378 place count 787 transition count 1482
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 391 place count 787 transition count 1482
Applied a total of 391 rules in 243 ms. Remains 787 /980 variables (removed 193) and now considering 1482/1667 (removed 185) transitions.
// Phase 1: matrix 1482 rows 787 cols
[2025-05-30 06:02:04] [INFO ] Computed 112 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:02:04] [INFO ] Implicit Places using invariants in 559 ms returned [142, 249, 250, 262, 273, 276, 280, 295, 296, 387, 394, 404, 407, 525, 528, 542, 649, 656, 673, 784]
[2025-05-30 06:02:04] [INFO ] Actually due to overlaps returned [295, 296, 262, 273, 387, 394, 407, 656, 142, 249, 276, 280, 525, 528, 542, 649, 673, 784]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 562 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 769/1031 places, 1482/1667 transitions.
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 769 transition count 1481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 768 transition count 1481
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 5 place count 765 transition count 1478
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 765 transition count 1478
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 762 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 761 transition count 1473
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 761 transition count 1473
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 21 place count 761 transition count 1468
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 756 transition count 1468
Applied a total of 26 rules in 98 ms. Remains 756 /769 variables (removed 13) and now considering 1468/1482 (removed 14) transitions.
// Phase 1: matrix 1468 rows 756 cols
[2025-05-30 06:02:05] [INFO ] Computed 94 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:02:05] [INFO ] Implicit Places using invariants in 444 ms returned [248]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 445 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 755/1031 places, 1468/1667 transitions.
Applied a total of 0 rules in 22 ms. Remains 755 /755 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2257 ms. Remains : 755/1031 places, 1468/1667 transitions.
RANDOM walk for 40000 steps (263 resets) in 343 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (53 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (52 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 259279 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 7
Probabilistic random walk after 259279 steps, saw 77713 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 1468 rows 755 cols
[2025-05-30 06:02:08] [INFO ] Computed 93 invariants in 11 ms
[2025-05-30 06:02:08] [INFO ] State equation strengthened by 8 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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 184/308 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/312 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 7/319 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 426/745 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 10/755 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1468/2223 variables, 755/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2223 variables, 8/856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2223 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2223 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2223/2223 variables, and 856 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 755/755 constraints, ReadFeed: 8/8 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 184/308 variables, 22/22 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 06:02:11] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:11] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:11] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/312 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/319 variables, 1/27 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 06:02:11] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 426/745 variables, 67/95 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 06:02:12] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:12] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:12] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:12] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:13] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:13] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:13] [INFO ] Deduced a trap composed of 37 places in 455 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:13] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:14] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:14] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:14] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:14] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:02:14] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/745 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/745 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 10/755 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/755 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1468/2223 variables, 755/865 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2223 variables, 8/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2223 variables, 5/878 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 06:02:27] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 12 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2223 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2223 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/2223 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2223/2223 variables, and 879 constraints, problems are : Problem set: 0 solved, 7 unsolved in 39455 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 755/755 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41939ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 32105 ms.
Support contains 124 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1468/1468 transitions.
Applied a total of 0 rules in 21 ms. Remains 755 /755 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 755/755 places, 1468/1468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 1468/1468 transitions.
Applied a total of 0 rules in 19 ms. Remains 755 /755 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
[2025-05-30 06:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:23] [INFO ] Implicit Places using invariants in 491 ms returned []
[2025-05-30 06:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:03:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 06:03:28] [INFO ] Implicit Places using invariants and state equation in 4658 ms returned []
Implicit Place search using SMT with State Equation took 5150 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:03:28] [INFO ] Redundant transitions in 144 ms returned []
Running 1446 sub problems to find dead transitions.
[2025-05-30 06:03:28] [INFO ] Invariant cache hit.
[2025-05-30 06:03:28] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:03:46] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:03:46] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:03:47] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 timeout
0.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2223 variables, and 69 constraints, problems are : Problem set: 0 solved, 1446 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 9/24 constraints, Generalized P Invariants (flows): 57/69 constraints, State Equation: 0/755 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1446/1446 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1446 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2223 variables, and 69 constraints, problems are : Problem set: 0 solved, 1446 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 9/24 constraints, Generalized P Invariants (flows): 57/69 constraints, State Equation: 0/755 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/1446 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60931ms problems are : Problem set: 0 solved, 1446 unsolved
Search for dead transitions found 0 dead transitions in 60937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66304 ms. Remains : 755/755 places, 1468/1468 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 3387 edges and 755 vertex of which 752 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output 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 3 place count 752 transition count 1466
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 750 transition count 1466
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 5 place count 750 transition count 1461
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 745 transition count 1461
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 744 transition count 1461
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 741 transition count 1458
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 741 transition count 1455
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 738 transition count 1455
Applied a total of 28 rules in 96 ms. Remains 738 /755 variables (removed 17) and now considering 1455/1468 (removed 13) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1455 rows 738 cols
[2025-05-30 06:04:29] [INFO ] Computed 89 invariants in 20 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 06:04:29] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 06:04:29] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2025-05-30 06:04:29] [INFO ] [Nat]Absence check using 22 positive and 67 generalized place invariants in 21 ms returned sat
[2025-05-30 06:04:34] [INFO ] After 4541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2025-05-30 06:04:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 06:04:38] [INFO ] After 3827ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:39] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 13 ms to minimize.
[2025-05-30 06:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:46] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:46] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:46] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:47] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:47] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:47] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:47] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 35 ms to minimize.
[2025-05-30 06:04:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1896 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:48] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:48] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 13 ms to minimize.
[2025-05-30 06:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1195 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:53] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 12 ms to minimize.
[2025-05-30 06:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:04:57] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 14 ms to minimize.
[2025-05-30 06:04:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
TRAPS : Iteration 4
[2025-05-30 06:05:03] [INFO ] After 28815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2025-05-30 06:05:07] [INFO ] After 38247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2025-05-30 06:05:07] [INFO ] Flatten gal took : 78 ms
[2025-05-30 06:05:08] [INFO ] Flatten gal took : 51 ms
[2025-05-30 06:05:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1588896000105745575.gal : 20 ms
[2025-05-30 06:05:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4465445881433130082.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/ReachabilityCardinality1588896000105745575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4465445881433130082.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/ReachabilityCardinality4465445881433130082.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :18 after 46
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :46 after 56
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :56 after 2680
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2680 after 5.94791e+07
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :5.94791e+07 after 1.05286e+11
Detected timeout of ITS tools.
[2025-05-30 06:05:23] [INFO ] Flatten gal took : 49 ms
[2025-05-30 06:05:23] [INFO ] Applying decomposition
[2025-05-30 06:05:23] [INFO ] Flatten gal took : 64 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/graph10655229609853073393.txt' '-o' '/tmp/graph10655229609853073393.bin' '-w' '/tmp/graph10655229609853073393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10655229609853073393.bin' '-l' '-1' '-v' '-w' '/tmp/graph10655229609853073393.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:05:23] [INFO ] Decomposing Gal with order
[2025-05-30 06:05:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:05:24] [INFO ] Removed a total of 2375 redundant transitions.
[2025-05-30 06:05:24] [INFO ] Flatten gal took : 341 ms
[2025-05-30 06:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 68 ms.
[2025-05-30 06:05:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15133186781188440388.gal : 34 ms
[2025-05-30 06:05:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11306793429225846613.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/ReachabilityCardinality15133186781188440388.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11306793429225846613.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/ReachabilityCardinality11306793429225846613.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :2 after 40
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :40 after 154944
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :154944 after 8.86729e+10
Invariant property ASLink-PT-05b-ReachabilityCardinality-2025-15 does not hold.
Invariant property ASLink-PT-05b-ReachabilityCardinality-2025-13 does not hold.
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :8.86729e+10 after 8.01384e+12
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 70556 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 06:05:40] [INFO ] Flatten gal took : 180 ms
[2025-05-30 06:05:40] [INFO ] Applying decomposition
[2025-05-30 06:05:40] [INFO ] Flatten gal took : 149 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/graph16384561450437080479.txt' '-o' '/tmp/graph16384561450437080479.bin' '-w' '/tmp/graph16384561450437080479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16384561450437080479.bin' '-l' '-1' '-v' '-w' '/tmp/graph16384561450437080479.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:05:40] [INFO ] Decomposing Gal with order
[2025-05-30 06:05:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:05:41] [INFO ] Removed a total of 2252 redundant transitions.
[2025-05-30 06:05:41] [INFO ] Flatten gal took : 313 ms
[2025-05-30 06:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 100 ms.
[2025-05-30 06:05:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7494446845501342824.gal : 57 ms
[2025-05-30 06:05:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality264580714018479291.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/ReachabilityCardinality7494446845501342824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality264580714018479291.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 ...306
Loading property file /tmp/ReachabilityCardinality264580714018479291.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :1 after 30
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :30 after 184203
Detected timeout of ITS tools.
[2025-05-30 06:35:41] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7856678171912624598
[2025-05-30 06:35:41] [INFO ] Applying decomposition
[2025-05-30 06:35:41] [INFO ] Computing symmetric may disable matrix : 1468 transitions.
[2025-05-30 06:35:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:35:41] [INFO ] Computing symmetric may enable matrix : 1468 transitions.
[2025-05-30 06:35:41] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:35:41] [INFO ] Flatten gal took : 60 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/graph3637356832223095146.txt' '-o' '/tmp/graph3637356832223095146.bin' '-w' '/tmp/graph3637356832223095146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3637356832223095146.bin' '-l' '-1' '-v' '-w' '/tmp/graph3637356832223095146.weights' '-q' '0' '-e' '0.001'
[2025-05-30 06:35:41] [INFO ] Decomposing Gal with order
[2025-05-30 06:35:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 06:35:41] [INFO ] Removed a total of 2376 redundant transitions.
[2025-05-30 06:35:41] [INFO ] Flatten gal took : 76 ms
[2025-05-30 06:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 12 ms.
[2025-05-30 06:35:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13225722167920838281.gal : 11 ms
[2025-05-30 06:35:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1031883906428420713.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/ReachabilityCardinality13225722167920838281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1031883906428420713.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-05-30 06:35:42] [INFO ] Computing Do-Not-Accords matrix : 1468 transitions.
Loading property file /tmp/ReachabilityCardinality1031883906428420713.prop.
[2025-05-30 06:35:42] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 06:35:42] [INFO ] Built C files in 553ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7856678171912624598
Running compilation step : cd /tmp/ltsmin7856678171912624598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '102' '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,7 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :3 after 16
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :16 after 56
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :56 after 56
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :56 after 2188
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :5.51421e+11 after 1.01124e+12
Invariant property ASLink-PT-05b-ReachabilityCardinality-2025-15 does not hold.
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-05b-ReachabilityCardinality-2025-13 does not hold.
FORMULA ASLink-PT-05b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.01124e+12 after 2.24511e+12
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2.24511e+12 after 2.29509e+12
Compilation finished in 5632 ms.
Running link step : cd /tmp/ltsmin7856678171912624598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202500==true'
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :2.29509e+12 after 2.49632e+12
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2.49632e+12 after 2.82186e+12
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.82186e+12 after 3.82478e+12
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :3.82478e+12 after 9.43959e+12
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :9.43959e+12 after 1.18139e+14
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202303==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202303==true'
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202507==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202507==true'
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202409==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202409==true'
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202514==true'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202514==true'
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202500==true'
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202500==true'
Running LTSmin : cd /tmp/ltsmin7856678171912624598;'/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' 'ASLinkPT05bReachabilityCardinality202303==true'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729100358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;