fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r245-tall-171654349100079
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S24C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11237.976 3600000.00 5517269.00 7923.40 TFT??TT?FTFFT??T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349100079.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is MultiCrashLeafsetExtension-PT-S24C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 12 06:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 06:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 06:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 10M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716588681193

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 22:11:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 22:11:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 22:11:23] [INFO ] Load time of PNML (sax parser for PT used): 592 ms
[2024-05-24 22:11:23] [INFO ] Transformed 9748 places.
[2024-05-24 22:11:23] [INFO ] Transformed 14659 transitions.
[2024-05-24 22:11:23] [INFO ] Parsed PT model containing 9748 places and 14659 transitions and 58838 arcs in 756 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (962 resets) in 3589 ms. (11 steps per ms) remains 12/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (176 resets) in 763 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (176 resets) in 1204 ms. (33 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (176 resets) in 269 ms. (148 steps per ms) remains 11/12 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (176 resets) in 301 ms. (132 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 403 ms. (99 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 293 ms. (136 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (176 resets) in 226 ms. (176 steps per ms) remains 10/11 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (176 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (176 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
[2024-05-24 22:11:25] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2024-05-24 22:11:26] [INFO ] Computed 921 invariants in 895 ms
[2024-05-24 22:11:26] [INFO ] State equation strengthened by 4402 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 2305/2550 variables, 29/46 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2550 variables, 5/51 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2550 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/2567 variables, 17/68 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2567 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 4769/7336 variables, 377/445 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/7336 variables, 0/445 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2412/9748 variables, 476/921 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9748 variables, 0/921 constraints. Problems are: Problem set: 4 solved, 6 unsolved
SMT process timed out in 6507ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 9748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.40 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2349 transitions
Trivial Post-agglo rules discarded 2349 transitions
Performed 2349 trivial Post agglomeration. Transition count delta: 2349
Iterating post reduction 0 with 2349 rules applied. Total rules applied 2350 place count 9712 transition count 12310
Reduce places removed 2349 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4747 place count 7363 transition count 12262
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 4795 place count 7315 transition count 12262
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 4795 place count 7315 transition count 12066
Deduced a syphon composed of 196 places in 8 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 5187 place count 7119 transition count 12066
Discarding 2193 places :
Symmetric choice reduction at 3 with 2193 rule applications. Total rules 7380 place count 4926 transition count 9873
Iterating global reduction 3 with 2193 rules applied. Total rules applied 9573 place count 4926 transition count 9873
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9573 place count 4926 transition count 9870
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 9579 place count 4923 transition count 9870
Discarding 539 places :
Symmetric choice reduction at 3 with 539 rule applications. Total rules 10118 place count 4384 transition count 7714
Iterating global reduction 3 with 539 rules applied. Total rules applied 10657 place count 4384 transition count 7714
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 10703 place count 4361 transition count 7691
Free-agglomeration rule (complex) applied 338 times.
Iterating global reduction 3 with 338 rules applied. Total rules applied 11041 place count 4361 transition count 8907
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 3 with 338 rules applied. Total rules applied 11379 place count 4023 transition count 8907
Partial Free-agglomeration rule applied 121 times.
Drop transitions (Partial Free agglomeration) removed 121 transitions
Iterating global reduction 4 with 121 rules applied. Total rules applied 11500 place count 4023 transition count 8907
Applied a total of 11500 rules in 4696 ms. Remains 4023 /9748 variables (removed 5725) and now considering 8907/14659 (removed 5752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4708 ms. Remains : 4023/9748 places, 8907/14659 transitions.
RANDOM walk for 40000 steps (1560 resets) in 1409 ms. (28 steps per ms) remains 5/6 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C04-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (188 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (188 resets) in 198 ms. (201 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
[2024-05-24 22:11:37] [INFO ] Flow matrix only has 8024 transitions (discarded 883 similar events)
// Phase 1: matrix 8024 rows 4023 cols
[2024-05-24 22:11:38] [INFO ] Computed 885 invariants in 221 ms
[2024-05-24 22:11:38] [INFO ] State equation strengthened by 4339 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2779/2792 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:11:40] [INFO ] Deduced a trap composed of 591 places in 1476 ms of which 101 ms to minimize.
[2024-05-24 22:11:41] [INFO ] Deduced a trap composed of 634 places in 1252 ms of which 13 ms to minimize.
[2024-05-24 22:11:42] [INFO ] Deduced a trap composed of 623 places in 1186 ms of which 18 ms to minimize.
[2024-05-24 22:11:43] [INFO ] Deduced a trap composed of 580 places in 1195 ms of which 12 ms to minimize.
[2024-05-24 22:11:45] [INFO ] Deduced a trap composed of 570 places in 1221 ms of which 12 ms to minimize.
[2024-05-24 22:11:46] [INFO ] Deduced a trap composed of 569 places in 1174 ms of which 12 ms to minimize.
[2024-05-24 22:11:47] [INFO ] Deduced a trap composed of 590 places in 1132 ms of which 11 ms to minimize.
[2024-05-24 22:11:48] [INFO ] Deduced a trap composed of 618 places in 1118 ms of which 11 ms to minimize.
[2024-05-24 22:11:49] [INFO ] Deduced a trap composed of 600 places in 1123 ms of which 11 ms to minimize.
[2024-05-24 22:11:50] [INFO ] Deduced a trap composed of 601 places in 1129 ms of which 12 ms to minimize.
[2024-05-24 22:11:52] [INFO ] Deduced a trap composed of 573 places in 1182 ms of which 11 ms to minimize.
[2024-05-24 22:11:53] [INFO ] Deduced a trap composed of 591 places in 1212 ms of which 12 ms to minimize.
[2024-05-24 22:11:54] [INFO ] Deduced a trap composed of 813 places in 1167 ms of which 12 ms to minimize.
[2024-05-24 22:11:55] [INFO ] Deduced a trap composed of 862 places in 1143 ms of which 12 ms to minimize.
[2024-05-24 22:11:57] [INFO ] Deduced a trap composed of 491 places in 1315 ms of which 11 ms to minimize.
[2024-05-24 22:11:58] [INFO ] Deduced a trap composed of 500 places in 1264 ms of which 11 ms to minimize.
[2024-05-24 22:11:59] [INFO ] Deduced a trap composed of 503 places in 1285 ms of which 12 ms to minimize.
[2024-05-24 22:12:01] [INFO ] Deduced a trap composed of 511 places in 1296 ms of which 12 ms to minimize.
[2024-05-24 22:12:02] [INFO ] Deduced a trap composed of 822 places in 1098 ms of which 11 ms to minimize.
[2024-05-24 22:12:03] [INFO ] Deduced a trap composed of 533 places in 1274 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2792 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:12:04] [INFO ] Deduced a trap composed of 443 places in 1191 ms of which 11 ms to minimize.
[2024-05-24 22:12:06] [INFO ] Deduced a trap composed of 762 places in 987 ms of which 13 ms to minimize.
[2024-05-24 22:12:07] [INFO ] Deduced a trap composed of 1331 places in 838 ms of which 13 ms to minimize.
[2024-05-24 22:12:09] [INFO ] Deduced a trap composed of 683 places in 2061 ms of which 18 ms to minimize.
[2024-05-24 22:12:10] [INFO ] Deduced a trap composed of 949 places in 921 ms of which 12 ms to minimize.
[2024-05-24 22:12:10] [INFO ] Deduced a trap composed of 1563 places in 777 ms of which 12 ms to minimize.
[2024-05-24 22:12:13] [INFO ] Deduced a trap composed of 783 places in 2141 ms of which 17 ms to minimize.
[2024-05-24 22:12:15] [INFO ] Deduced a trap composed of 1352 places in 2103 ms of which 17 ms to minimize.
[2024-05-24 22:12:16] [INFO ] Deduced a trap composed of 502 places in 1291 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2792 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:12:18] [INFO ] Deduced a trap composed of 607 places in 1241 ms of which 12 ms to minimize.
[2024-05-24 22:12:19] [INFO ] Deduced a trap composed of 602 places in 1337 ms of which 12 ms to minimize.
[2024-05-24 22:12:21] [INFO ] Deduced a trap composed of 649 places in 1293 ms of which 12 ms to minimize.
[2024-05-24 22:12:23] [INFO ] Deduced a trap composed of 573 places in 2210 ms of which 18 ms to minimize.
SMT process timed out in 45793ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 4023 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4023/4023 places, 8907/8907 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 4023 transition count 8905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 4021 transition count 8905
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 4021 transition count 8901
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 4017 transition count 8901
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 4013 transition count 8897
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 4013 transition count 8897
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 4013 transition count 8895
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 4011 transition count 8895
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 4010 transition count 8894
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 4010 transition count 8919
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 42 place count 4002 transition count 8919
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 4000 transition count 8917
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 4000 transition count 8917
Applied a total of 46 rules in 1795 ms. Remains 4000 /4023 variables (removed 23) and now considering 8917/8907 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1795 ms. Remains : 4000/4023 places, 8917/8907 transitions.
RANDOM walk for 40000 steps (1581 resets) in 1252 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (188 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (188 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 24439 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 5
Probabilistic random walk after 24439 steps, saw 11083 distinct states, run finished after 3005 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 22:12:29] [INFO ] Flow matrix only has 8032 transitions (discarded 885 similar events)
// Phase 1: matrix 8032 rows 4000 cols
[2024-05-24 22:12:29] [INFO ] Computed 885 invariants in 215 ms
[2024-05-24 22:12:29] [INFO ] State equation strengthened by 4372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2831/2844 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:12:31] [INFO ] Deduced a trap composed of 633 places in 1794 ms of which 15 ms to minimize.
[2024-05-24 22:12:33] [INFO ] Deduced a trap composed of 560 places in 1762 ms of which 16 ms to minimize.
[2024-05-24 22:12:35] [INFO ] Deduced a trap composed of 509 places in 1741 ms of which 16 ms to minimize.
[2024-05-24 22:12:36] [INFO ] Deduced a trap composed of 1004 places in 1618 ms of which 14 ms to minimize.
[2024-05-24 22:12:38] [INFO ] Deduced a trap composed of 797 places in 1531 ms of which 15 ms to minimize.
[2024-05-24 22:12:40] [INFO ] Deduced a trap composed of 557 places in 1750 ms of which 14 ms to minimize.
[2024-05-24 22:12:42] [INFO ] Deduced a trap composed of 759 places in 2199 ms of which 23 ms to minimize.
[2024-05-24 22:12:44] [INFO ] Deduced a trap composed of 923 places in 2323 ms of which 20 ms to minimize.
[2024-05-24 22:12:47] [INFO ] Deduced a trap composed of 407 places in 2347 ms of which 20 ms to minimize.
[2024-05-24 22:12:49] [INFO ] Deduced a trap composed of 1328 places in 2299 ms of which 19 ms to minimize.
[2024-05-24 22:12:51] [INFO ] Deduced a trap composed of 653 places in 1665 ms of which 14 ms to minimize.
[2024-05-24 22:12:53] [INFO ] Deduced a trap composed of 613 places in 1640 ms of which 15 ms to minimize.
[2024-05-24 22:12:54] [INFO ] Deduced a trap composed of 867 places in 1584 ms of which 13 ms to minimize.
[2024-05-24 22:12:56] [INFO ] Deduced a trap composed of 751 places in 1622 ms of which 15 ms to minimize.
[2024-05-24 22:12:58] [INFO ] Deduced a trap composed of 671 places in 1648 ms of which 14 ms to minimize.
[2024-05-24 22:12:59] [INFO ] Deduced a trap composed of 604 places in 1608 ms of which 14 ms to minimize.
[2024-05-24 22:13:01] [INFO ] Deduced a trap composed of 501 places in 1667 ms of which 14 ms to minimize.
[2024-05-24 22:13:03] [INFO ] Deduced a trap composed of 717 places in 1659 ms of which 15 ms to minimize.
[2024-05-24 22:13:04] [INFO ] Deduced a trap composed of 607 places in 1641 ms of which 14 ms to minimize.
[2024-05-24 22:13:06] [INFO ] Deduced a trap composed of 585 places in 1587 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2844 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:13:08] [INFO ] Deduced a trap composed of 522 places in 1718 ms of which 15 ms to minimize.
[2024-05-24 22:13:10] [INFO ] Deduced a trap composed of 528 places in 1736 ms of which 15 ms to minimize.
[2024-05-24 22:13:11] [INFO ] Deduced a trap composed of 595 places in 1799 ms of which 16 ms to minimize.
[2024-05-24 22:13:13] [INFO ] Deduced a trap composed of 620 places in 1563 ms of which 24 ms to minimize.
[2024-05-24 22:13:15] [INFO ] Deduced a trap composed of 620 places in 1531 ms of which 14 ms to minimize.
[2024-05-24 22:13:16] [INFO ] Deduced a trap composed of 572 places in 1634 ms of which 14 ms to minimize.
[2024-05-24 22:13:18] [INFO ] Deduced a trap composed of 879 places in 1634 ms of which 14 ms to minimize.
[2024-05-24 22:13:20] [INFO ] Deduced a trap composed of 662 places in 1580 ms of which 14 ms to minimize.
[2024-05-24 22:13:21] [INFO ] Deduced a trap composed of 526 places in 1558 ms of which 14 ms to minimize.
[2024-05-24 22:13:24] [INFO ] Deduced a trap composed of 1560 places in 2129 ms of which 19 ms to minimize.
[2024-05-24 22:13:25] [INFO ] Deduced a trap composed of 445 places in 1706 ms of which 16 ms to minimize.
[2024-05-24 22:13:27] [INFO ] Deduced a trap composed of 485 places in 1691 ms of which 15 ms to minimize.
[2024-05-24 22:13:29] [INFO ] Deduced a trap composed of 511 places in 1614 ms of which 14 ms to minimize.
[2024-05-24 22:13:30] [INFO ] Deduced a trap composed of 457 places in 1624 ms of which 14 ms to minimize.
[2024-05-24 22:13:32] [INFO ] Deduced a trap composed of 574 places in 1595 ms of which 14 ms to minimize.
[2024-05-24 22:13:34] [INFO ] Deduced a trap composed of 670 places in 1591 ms of which 15 ms to minimize.
[2024-05-24 22:13:35] [INFO ] Deduced a trap composed of 553 places in 1592 ms of which 15 ms to minimize.
[2024-05-24 22:13:37] [INFO ] Deduced a trap composed of 470 places in 1584 ms of which 14 ms to minimize.
[2024-05-24 22:13:39] [INFO ] Deduced a trap composed of 521 places in 1563 ms of which 14 ms to minimize.
[2024-05-24 22:13:40] [INFO ] Deduced a trap composed of 474 places in 1615 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2844 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:13:43] [INFO ] Deduced a trap composed of 1195 places in 2196 ms of which 19 ms to minimize.
[2024-05-24 22:13:45] [INFO ] Deduced a trap composed of 457 places in 2188 ms of which 18 ms to minimize.
SMT process timed out in 76832ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 4000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4000/4000 places, 8917/8917 transitions.
Applied a total of 0 rules in 491 ms. Remains 4000 /4000 variables (removed 0) and now considering 8917/8917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 4000/4000 places, 8917/8917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4000/4000 places, 8917/8917 transitions.
Applied a total of 0 rules in 470 ms. Remains 4000 /4000 variables (removed 0) and now considering 8917/8917 (removed 0) transitions.
[2024-05-24 22:13:46] [INFO ] Flow matrix only has 8032 transitions (discarded 885 similar events)
[2024-05-24 22:13:46] [INFO ] Invariant cache hit.
[2024-05-24 22:13:57] [INFO ] Implicit Places using invariants in 10345 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 83, 101, 121, 143, 166, 188, 189, 190, 191, 192, 213, 231, 247, 261, 273, 283, 291, 297, 301, 303, 314, 320, 322, 323, 324, 325, 326, 328, 332, 338, 346, 356, 368, 382, 398, 416, 436, 457, 477, 478, 479, 480, 481, 499, 515, 529, 541, 551, 559, 565, 569, 571, 573, 584, 590, 592, 593, 594, 595, 596, 598, 600, 604, 610, 618, 628, 640, 654, 670, 688, 707, 725, 726, 727, 728, 729, 745, 759, 771, 781, 789, 795, 799, 801, 803, 805, 816, 822, 824, 825, 826, 827, 828, 830, 832, 834, 838, 844, 852, 862, 874, 888, 904, 921, 937, 938, 939, 940, 941, 955, 967, 977, 985, 991, 995, 997, 999, 1001, 1003, 1014, 1020, 1022, 1023, 1024, 1025, 1026, 1028, 1030, 1032, 1034, 1038, 1044, 1052, 1062, 1074, 1088, 1103, 1117, 1118, 1119, 1120, 1121, 1133, 1143, 1151, 1157, 1161, 1163, 1165, 1167, 1169, 1171, 1182, 1188, 1190, 1191, 1192, 1193, 1194, 1196, 1198, 1200, 1202, 1204, 1208, 1214, 1222, 1232, 1244, 1257, 1269, 1270, 1271, 1272, 1273, 1283, 1291, 1297, 1301, 1303, 1305, 1307, 1309, 1311, 1313, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1338, 1340, 1342, 1344, 1346, 1348, 1352, 1358, 1366, 1376, 1387, 1397, 1398, 1399, 1400, 1401, 1409, 1415, 1419, 1421, 1423, 1425, 1427, 1429, 1431, 1433, 1444, 1450, 1452, 1453, 1454, 1455, 1456, 1458, 1460, 1462, 1464, 1466, 1468, 1470, 1474, 1480, 1488, 1497, 1506, 1507, 1508, 1509, 1510, 1517, 1521, 1523, 1525, 1527, 1529, 1531, 1533, 1535, 1537, 1548, 1554, 1556, 1557, 1558, 1559, 1560, 1562, 1564, 1566, 1568, 1570, 1572, 1574, 1576, 1580, 1586, 1593, 1599, 1600, 1601, 1602, 1603, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1636, 1642, 1644, 1645, 1646, 1647, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1670, 1675, 1679, 1680, 1681, 1682, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1714, 1720, 1722, 1723, 1724, 1725, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1740, 1742, 1744, 1746, 1749, 1751, 1752, 1753, 1754, 1755, 1757, 1759, 1761, 1763, 1765, 1767, 1769, 1771, 1773, 1775, 1786, 1792, 1794, 1795, 1796, 1797, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1822, 1823, 1824, 1825, 1826, 1828, 1830, 1832, 1834, 1836, 1838, 1840, 1842, 1844, 1846, 1857, 1859, 1862, 1864, 1865, 1866, 1867, 1868, 1870, 1872, 1874, 1876, 1878, 1880, 1882, 1884, 1886, 1888, 1890, 1892, 1893, 1894, 1895, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1927, 1933, 1935, 1937, 1938, 1939, 1941, 1943, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1959, 1963, 1965, 1966, 1967, 1968, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1989, 2000, 2006, 2008, 2009, 2010, 2011, 2012, 2014, 2016, 2018, 2020, 2022, 2024, 2026, 2028, 2030, 2032, 2034, 2037, 2038, 2039, 2040, 2041, 2043, 2045, 2047, 2049, 2051, 2053, 2055, 2057, 2059, 2061, 2072, 2078, 2080, 2081, 2082, 2083, 2084, 2086, 2088, 2090, 2092, 2094, 2096, 2098, 2100, 2102, 2104, 2108, 2113, 2114, 2115, 2116, 2117, 2121, 2123, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2150, 2156, 2158, 2159, 2160, 2161, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2178, 2180, 2184, 2190, 2197, 2198, 2199, 2200, 2201, 2207, 2211, 2213, 2215, 2217, 2219, 2221, 2223, 2225, 2227, 2238, 2244, 2246, 2247, 2248, 2249, 2250, 2252, 2254, 2256, 2258, 2260, 2262, 2264, 2266, 2270, 2276, 2284, 2293, 2294, 2295, 2296, 2297, 2305, 2311, 2315, 2317, 2319, 2321, 2323, 2325, 2327, 2329, 2340, 2346, 2348, 2349, 2350, 2351, 2352, 2354, 2356, 2358, 2360, 2362, 2364, 2366, 2370, 2376, 2384, 2394, 2405, 2406, 2407, 2408, 2409, 2419, 2427, 2433, 2437, 2439, 2441, 2443, 2445, 2447, 2449, 2460, 2466, 2468, 2469, 2470, 2471, 2472, 2474, 2476, 2478, 2480, 2482, 2484, 2488, 2494, 2502, 2512, 2524, 2537, 2538, 2539, 2540, 2541, 2553, 2563, 2571, 2577, 2581, 2583, 2585, 2587, 2589, 2591, 2602, 2608, 2610, 2611, 2612, 2613, 2614, 2616, 2618, 2620, 2622, 2624, 2628, 2634, 2642, 2652, 2664, 2678, 2693, 2694, 2695, 2696, 2697, 2711, 2723, 2733, 2741, 2747, 2751, 2753, 2755, 2757, 2759, 2770, 2776, 2778, 2779, 2780, 2781, 2782, 2784, 2786, 2788, 2790, 2794, 2800, 2808, 2818, 2830, 2844, 2860, 2877, 2878, 2879, 2880, 2881, 2897, 2911, 2923, 2933, 2941, 2947, 2951, 2953, 2955, 2957, 2968, 2974, 2976, 2977, 2978, 2979, 2980, 2982, 2984, 2986, 2990, 2996, 3004, 3014, 3026, 3040, 3056, 3074, 3093, 3094, 3095, 3096, 3097, 3115, 3131, 3145, 3157, 3167, 3175, 3181, 3185, 3187, 3189, 3200, 3206, 3208, 3209, 3210, 3211, 3212, 3214, 3216, 3220, 3226, 3234, 3244, 3256, 3270, 3286, 3304, 3324, 3345, 3346, 3347, 3348, 3349, 3369, 3387, 3403, 3417, 3429, 3439, 3447, 3453, 3457, 3459, 3470, 3472, 3476, 3478, 3479, 3480, 3481, 3482, 3484, 3488, 3494, 3502, 3512, 3524, 3538, 3554, 3572, 3592, 3614, 3637, 3638, 3639, 3640, 3641, 3663, 3683, 3701, 3717, 3731, 3743, 3753, 3761, 3767, 3771, 3782]
[2024-05-24 22:13:57] [INFO ] Actually due to overlaps returned [314, 584, 816, 1014, 1182, 1324, 1444, 1548, 1636, 1714, 1786, 1857, 1927, 2000, 2072, 2150, 2238, 2340, 2460, 2602, 2770, 2968, 3200, 3470, 3782, 4, 9, 10, 11, 12, 188, 189, 190, 191, 322, 323, 324, 325, 477, 478, 479, 480, 592, 593, 594, 595, 725, 726, 727, 728, 824, 825, 826, 827, 937, 938, 939, 940, 1022, 1023, 1024, 1025, 1117, 1118, 1119, 1120, 1190, 1191, 1192, 1193, 1269, 1270, 1271, 1272, 1332, 1333, 1334, 1335, 1397, 1398, 1399, 1400, 1452, 1453, 1454, 1455, 1506, 1507, 1508, 1509, 1556, 1557, 1558, 1559, 1599, 1600, 1601, 1602, 1644, 1645, 1646, 1647, 1679, 1680, 1681, 1682, 1722, 1723, 1724, 1725, 1751, 1752, 1753, 1754, 1794, 1795, 1796, 1797, 1822, 1823, 1824, 1825, 1859, 1864, 1865, 1866, 1867, 1892, 1893, 1894, 1895, 1935, 1937, 1938, 1965, 1966, 1967, 1968, 2008, 2009, 2010, 2011, 2037, 2038, 2039, 2040, 2080, 2081, 2082, 2083, 2113, 2114, 2115, 2116, 2158, 2159, 2160, 2161, 2197, 2198, 2199, 2200, 2246, 2247, 2248, 2249, 2293, 2294, 2295, 2296, 2348, 2349, 2350, 2351, 2405, 2406, 2407, 2408, 2468, 2469, 2470, 2471, 2537, 2538, 2539, 2540, 2610, 2611, 2612, 2613, 2693, 2694, 2695, 2696, 2778, 2779, 2780, 2781, 2877, 2878, 2879, 2880, 2976, 2977, 2978, 2979, 3093, 3094, 3095, 3096, 3208, 3209, 3210, 3211, 3345, 3346, 3347, 3348, 3472, 3478, 3479, 3480, 3481, 3637, 3638, 3639, 3640]
Discarding 227 places :
Implicit Place search using SMT only with invariants took 10376 ms to find 227 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3773/4000 places, 8917/8917 transitions.
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 191 place count 3582 transition count 8726
Iterating global reduction 0 with 191 rules applied. Total rules applied 382 place count 3582 transition count 8726
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 573 place count 3391 transition count 8535
Iterating global reduction 0 with 191 rules applied. Total rules applied 764 place count 3391 transition count 8535
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 767 place count 3391 transition count 8532
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 770 place count 3388 transition count 8532
Applied a total of 770 rules in 1346 ms. Remains 3388 /3773 variables (removed 385) and now considering 8532/8917 (removed 385) transitions.
[2024-05-24 22:13:58] [INFO ] Flow matrix only has 7647 transitions (discarded 885 similar events)
// Phase 1: matrix 7647 rows 3388 cols
[2024-05-24 22:13:58] [INFO ] Computed 658 invariants in 199 ms
[2024-05-24 22:14:06] [INFO ] Implicit Places using invariants in 8199 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 204, 222, 238, 252, 264, 274, 282, 288, 292, 294, 309, 311, 313, 317, 323, 331, 341, 353, 367, 383, 401, 421, 442, 462, 480, 496, 510, 522, 532, 540, 546, 550, 552, 554, 562, 564, 566, 568, 572, 578, 586, 596, 608, 622, 638, 656, 675, 693, 709, 723, 735, 745, 753, 759, 763, 765, 767, 769, 777, 779, 781, 783, 785, 789, 795, 803, 813, 825, 839, 855, 872, 888, 902, 914, 924, 932, 938, 942, 944, 946, 948, 950, 958, 960, 962, 964, 966, 968, 972, 978, 986, 996, 1008, 1022, 1037, 1051, 1063, 1073, 1081, 1087, 1091, 1093, 1095, 1097, 1099, 1101, 1109, 1111, 1113, 1115, 1117, 1119, 1121, 1125, 1131, 1139, 1149, 1161, 1174, 1186, 1196, 1204, 1210, 1214, 1216, 1218, 1220, 1222, 1224, 1226, 1234, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1252, 1258, 1266, 1276, 1287, 1297, 1305, 1311, 1315, 1317, 1319, 1321, 1323, 1325, 1327, 1329, 1337, 1339, 1341, 1343, 1345, 1347, 1349, 1351, 1353, 1357, 1363, 1371, 1380, 1389, 1396, 1400, 1402, 1404, 1406, 1408, 1410, 1412, 1414, 1416, 1424, 1426, 1428, 1430, 1432, 1434, 1436, 1438, 1440, 1442, 1446, 1452, 1459, 1465, 1469, 1471, 1473, 1475, 1477, 1479, 1481, 1483, 1485, 1487, 1495, 1497, 1499, 1501, 1503, 1505, 1507, 1509, 1511, 1513, 1515, 1519, 1524, 1528, 1530, 1532, 1534, 1536, 1538, 1540, 1542, 1544, 1546, 1548, 1556, 1558, 1560, 1562, 1564, 1566, 1568, 1570, 1572, 1574, 1576, 1578, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1597, 1599, 1601, 1603, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1716, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1743, 1745, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1774, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1794, 1796, 1798, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1819, 1821, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1847, 1849, 1851, 1855, 1860, 1864, 1866, 1868, 1870, 1872, 1874, 1876, 1878, 1880, 1882, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1908, 1910, 1914, 1920, 1927, 1933, 1937, 1939, 1941, 1943, 1945, 1947, 1949, 1951, 1953, 1961, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1983, 1989, 1997, 2006, 2014, 2020, 2024, 2026, 2028, 2030, 2032, 2034, 2036, 2038, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2066, 2072, 2080, 2090, 2101, 2111, 2119, 2125, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2149, 2151, 2153, 2155, 2157, 2159, 2161, 2163, 2167, 2173, 2181, 2191, 2203, 2216, 2228, 2238, 2246, 2252, 2256, 2258, 2260, 2262, 2264, 2266, 2274, 2276, 2278, 2280, 2282, 2284, 2286, 2290, 2296, 2304, 2314, 2326, 2340, 2355, 2369, 2381, 2391, 2399, 2405, 2409, 2411, 2413, 2415, 2417, 2425, 2427, 2429, 2431, 2433, 2435, 2439, 2445, 2453, 2463, 2475, 2489, 2505, 2522, 2538, 2552, 2564, 2574, 2582, 2588, 2592, 2594, 2596, 2598, 2606, 2608, 2610, 2612, 2614, 2618, 2624, 2632, 2642, 2654, 2668, 2684, 2702, 2721, 2739, 2755, 2769, 2781, 2791, 2799, 2805, 2809, 2811, 2813, 2821, 2823, 2825, 2827, 2831, 2837, 2845, 2855, 2867, 2881, 2897, 2915, 2935, 2956, 2976, 2994, 3010, 3024, 3036, 3046, 3054, 3060, 3064, 3066, 3073, 3075, 3077, 3081, 3087, 3095, 3105, 3117, 3131, 3147, 3165, 3185, 3207, 3230, 3252, 3272, 3290, 3306, 3320, 3332, 3342, 3350, 3356, 3360]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 8220 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2788/4000 places, 8532/8917 transitions.
Applied a total of 0 rules in 415 ms. Remains 2788 /2788 variables (removed 0) and now considering 8532/8532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 20830 ms. Remains : 2788/4000 places, 8532/8917 transitions.
RANDOM walk for 40000 steps (1702 resets) in 1482 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (125 resets) in 145 ms. (274 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (124 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (123 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (124 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (129 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 27951 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 5
Probabilistic random walk after 27951 steps, saw 11779 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:14:10] [INFO ] Flow matrix only has 7647 transitions (discarded 885 similar events)
// Phase 1: matrix 7647 rows 2788 cols
[2024-05-24 22:14:11] [INFO ] Computed 58 invariants in 131 ms
[2024-05-24 22:14:11] [INFO ] State equation strengthened by 4372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2696/2709 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:14:13] [INFO ] Deduced a trap composed of 136 places in 2062 ms of which 18 ms to minimize.
[2024-05-24 22:14:15] [INFO ] Deduced a trap composed of 141 places in 1974 ms of which 18 ms to minimize.
[2024-05-24 22:14:17] [INFO ] Deduced a trap composed of 111 places in 2028 ms of which 17 ms to minimize.
[2024-05-24 22:14:19] [INFO ] Deduced a trap composed of 108 places in 2086 ms of which 18 ms to minimize.
[2024-05-24 22:14:21] [INFO ] Deduced a trap composed of 256 places in 2097 ms of which 18 ms to minimize.
[2024-05-24 22:14:23] [INFO ] Deduced a trap composed of 119 places in 2042 ms of which 18 ms to minimize.
[2024-05-24 22:14:26] [INFO ] Deduced a trap composed of 151 places in 2025 ms of which 18 ms to minimize.
[2024-05-24 22:14:27] [INFO ] Deduced a trap composed of 137 places in 1935 ms of which 18 ms to minimize.
[2024-05-24 22:14:30] [INFO ] Deduced a trap composed of 150 places in 2064 ms of which 17 ms to minimize.
[2024-05-24 22:14:32] [INFO ] Deduced a trap composed of 130 places in 2065 ms of which 21 ms to minimize.
[2024-05-24 22:14:34] [INFO ] Deduced a trap composed of 165 places in 2065 ms of which 17 ms to minimize.
[2024-05-24 22:14:36] [INFO ] Deduced a trap composed of 119 places in 2006 ms of which 17 ms to minimize.
[2024-05-24 22:14:38] [INFO ] Deduced a trap composed of 141 places in 2026 ms of which 17 ms to minimize.
[2024-05-24 22:14:40] [INFO ] Deduced a trap composed of 155 places in 2034 ms of which 18 ms to minimize.
[2024-05-24 22:14:42] [INFO ] Deduced a trap composed of 106 places in 2018 ms of which 16 ms to minimize.
[2024-05-24 22:14:44] [INFO ] Deduced a trap composed of 137 places in 2031 ms of which 18 ms to minimize.
[2024-05-24 22:14:46] [INFO ] Deduced a trap composed of 151 places in 1966 ms of which 17 ms to minimize.
[2024-05-24 22:14:48] [INFO ] Deduced a trap composed of 120 places in 2046 ms of which 18 ms to minimize.
[2024-05-24 22:14:50] [INFO ] Deduced a trap composed of 114 places in 2034 ms of which 17 ms to minimize.
[2024-05-24 22:14:52] [INFO ] Deduced a trap composed of 1110 places in 1862 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2709 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:14:54] [INFO ] Deduced a trap composed of 103 places in 1989 ms of which 17 ms to minimize.
[2024-05-24 22:14:56] [INFO ] Deduced a trap composed of 107 places in 2050 ms of which 17 ms to minimize.
[2024-05-24 22:14:59] [INFO ] Deduced a trap composed of 152 places in 2074 ms of which 17 ms to minimize.
[2024-05-24 22:15:01] [INFO ] Deduced a trap composed of 141 places in 2048 ms of which 18 ms to minimize.
[2024-05-24 22:15:03] [INFO ] Deduced a trap composed of 124 places in 2041 ms of which 18 ms to minimize.
[2024-05-24 22:15:05] [INFO ] Deduced a trap composed of 143 places in 2058 ms of which 18 ms to minimize.
[2024-05-24 22:15:07] [INFO ] Deduced a trap composed of 129 places in 2037 ms of which 17 ms to minimize.
[2024-05-24 22:15:09] [INFO ] Deduced a trap composed of 118 places in 2020 ms of which 17 ms to minimize.
[2024-05-24 22:15:11] [INFO ] Deduced a trap composed of 133 places in 2019 ms of which 17 ms to minimize.
[2024-05-24 22:15:13] [INFO ] Deduced a trap composed of 144 places in 2030 ms of which 18 ms to minimize.
[2024-05-24 22:15:15] [INFO ] Deduced a trap composed of 1328 places in 1947 ms of which 17 ms to minimize.
[2024-05-24 22:15:17] [INFO ] Deduced a trap composed of 780 places in 2058 ms of which 18 ms to minimize.
[2024-05-24 22:15:19] [INFO ] Deduced a trap composed of 118 places in 1996 ms of which 17 ms to minimize.
[2024-05-24 22:15:21] [INFO ] Deduced a trap composed of 923 places in 1863 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2709 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:15:24] [INFO ] Deduced a trap composed of 108 places in 2036 ms of which 17 ms to minimize.
[2024-05-24 22:15:26] [INFO ] Deduced a trap composed of 785 places in 2045 ms of which 17 ms to minimize.
[2024-05-24 22:15:28] [INFO ] Deduced a trap composed of 91 places in 2036 ms of which 17 ms to minimize.
[2024-05-24 22:15:30] [INFO ] Deduced a trap composed of 112 places in 2009 ms of which 19 ms to minimize.
[2024-05-24 22:15:32] [INFO ] Deduced a trap composed of 1560 places in 2024 ms of which 17 ms to minimize.
[2024-05-24 22:15:34] [INFO ] Deduced a trap composed of 144 places in 1994 ms of which 18 ms to minimize.
[2024-05-24 22:15:36] [INFO ] Deduced a trap composed of 220 places in 1925 ms of which 17 ms to minimize.
[2024-05-24 22:15:38] [INFO ] Deduced a trap composed of 115 places in 1952 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2709 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2709 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 4/2713 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:15:41] [INFO ] Deduced a trap composed of 1485 places in 1862 ms of which 17 ms to minimize.
SMT process timed out in 90690ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 2788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2788/2788 places, 8532/8532 transitions.
Applied a total of 0 rules in 420 ms. Remains 2788 /2788 variables (removed 0) and now considering 8532/8532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 2788/2788 places, 8532/8532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2788/2788 places, 8532/8532 transitions.
Applied a total of 0 rules in 416 ms. Remains 2788 /2788 variables (removed 0) and now considering 8532/8532 (removed 0) transitions.
[2024-05-24 22:15:42] [INFO ] Flow matrix only has 7647 transitions (discarded 885 similar events)
[2024-05-24 22:15:42] [INFO ] Invariant cache hit.
[2024-05-24 22:15:47] [INFO ] Implicit Places using invariants in 4558 ms returned []
[2024-05-24 22:15:47] [INFO ] Flow matrix only has 7647 transitions (discarded 885 similar events)
[2024-05-24 22:15:47] [INFO ] Invariant cache hit.
[2024-05-24 22:15:49] [INFO ] State equation strengthened by 4372 read => feed constraints.
[2024-05-24 22:16:21] [INFO ] Performed 552/2788 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:16:53] [INFO ] Performed 1086/2788 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-24 22:17:23] [INFO ] Performed 1276/2788 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-05-24 22:17:54] [INFO ] Performed 1434/2788 implicitness test of which 0 returned IMPLICIT in 123 seconds.
[2024-05-24 22:17:54] [INFO ] Timeout of Implicit test with SMT after 123 seconds.
[2024-05-24 22:17:54] [INFO ] Implicit Places using invariants and state equation in 127440 ms returned []
Implicit Place search using SMT with State Equation took 132000 ms to find 0 implicit places.
[2024-05-24 22:17:55] [INFO ] Redundant transitions in 1004 ms returned []
Running 8438 sub problems to find dead transitions.
[2024-05-24 22:17:55] [INFO ] Flow matrix only has 7647 transitions (discarded 885 similar events)
[2024-05-24 22:17:55] [INFO ] Invariant cache hit.
[2024-05-24 22:17:55] [INFO ] State equation strengthened by 4372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2786 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 8438 unsolved
SMT process timed out in 70289ms, After SMT, problems are : Problem set: 0 solved, 8438 unsolved
Search for dead transitions found 0 dead transitions in 70366ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203826 ms. Remains : 2788/2788 places, 8532/8532 transitions.
[2024-05-24 22:19:05] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-24 22:19:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2788 places, 8532 transitions and 41665 arcs took 41 ms.
[2024-05-24 22:19:06] [INFO ] Flatten gal took : 512 ms
Total runtime 464293 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S24C04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2788
TRANSITIONS: 8532
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.198s, Sys 0.030s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.030s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 990
MODEL NAME: /home/mcc/execution/407/model
2788 places, 8532 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Error in allocating array of size 785402116 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="MultiCrashLeafsetExtension-PT-S24C04"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C04, 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 r245-tall-171654349100079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C04.tgz
mv MultiCrashLeafsetExtension-PT-S24C04 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;