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.r399-tall-171690529800182.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 StigmergyCommit-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529800182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12M 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 StigmergyCommit-PT-07b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716992135220

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 14:15:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 14:15:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:15:37] [INFO ] Load time of PNML (sax parser for PT used): 663 ms
[2024-05-29 14:15:37] [INFO ] Transformed 2443 places.
[2024-05-29 14:15:37] [INFO ] Transformed 15956 transitions.
[2024-05-29 14:15:37] [INFO ] Found NUPN structural information;
[2024-05-29 14:15:37] [INFO ] Parsed PT model containing 2443 places and 15956 transitions and 219500 arcs in 858 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (270 resets) in 2222 ms. (17 steps per ms) remains 7/12 properties
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (35 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 542 ms. (73 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (36 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
// Phase 1: matrix 15956 rows 2443 cols
[2024-05-29 14:15:39] [INFO ] Computed 9 invariants in 365 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2343/2443 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2443 variables, 2343/2452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2443 variables, 0/2452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18399/18399 variables, and 4895 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5050 ms.
Refiners :[Domain max(s): 2443/2443 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 2443/2443 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2343/2443 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2443 variables, 2343/2452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 14:15:51] [INFO ] Deduced a trap composed of 488 places in 6213 ms of which 104 ms to minimize.
SMT process timed out in 12491ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 2443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2239 edges and 2443 vertex of which 154 / 2443 are part of one of the 23 SCC in 10 ms
Free SCC test removed 131 places
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 3990 edges and 2312 vertex of which 2296 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.83 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1620 transitions
Trivial Post-agglo rules discarded 1620 transitions
Performed 1620 trivial Post agglomeration. Transition count delta: 1620
Iterating post reduction 0 with 1628 rules applied. Total rules applied 1630 place count 2296 transition count 14153
Reduce places removed 1620 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 1659 rules applied. Total rules applied 3289 place count 676 transition count 14114
Reduce places removed 17 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 2 with 90 rules applied. Total rules applied 3379 place count 659 transition count 14041
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 76 rules applied. Total rules applied 3455 place count 586 transition count 14038
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3456 place count 585 transition count 14038
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 88 Pre rules applied. Total rules applied 3456 place count 585 transition count 13950
Deduced a syphon composed of 88 places in 10 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 5 with 176 rules applied. Total rules applied 3632 place count 497 transition count 13950
Discarding 76 places :
Symmetric choice reduction at 5 with 76 rule applications. Total rules 3708 place count 421 transition count 13874
Iterating global reduction 5 with 76 rules applied. Total rules applied 3784 place count 421 transition count 13874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3784 place count 421 transition count 13873
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3786 place count 420 transition count 13873
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 3819 place count 387 transition count 1676
Iterating global reduction 5 with 33 rules applied. Total rules applied 3852 place count 387 transition count 1676
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 3857 place count 387 transition count 1671
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 3867 place count 377 transition count 1661
Iterating global reduction 6 with 10 rules applied. Total rules applied 3877 place count 377 transition count 1661
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 3883 place count 371 transition count 1655
Iterating global reduction 6 with 6 rules applied. Total rules applied 3889 place count 371 transition count 1655
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 3893 place count 371 transition count 1651
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3953 place count 341 transition count 1621
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3954 place count 341 transition count 1620
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3962 place count 333 transition count 1612
Iterating global reduction 8 with 8 rules applied. Total rules applied 3970 place count 333 transition count 1612
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3975 place count 328 transition count 1607
Iterating global reduction 8 with 5 rules applied. Total rules applied 3980 place count 328 transition count 1607
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3985 place count 323 transition count 1602
Iterating global reduction 8 with 5 rules applied. Total rules applied 3990 place count 323 transition count 1602
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 3996 place count 320 transition count 1620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3997 place count 320 transition count 1619
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4001 place count 320 transition count 1615
Free-agglomeration rule applied 77 times.
Iterating global reduction 9 with 77 rules applied. Total rules applied 4078 place count 320 transition count 1538
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 9 with 77 rules applied. Total rules applied 4155 place count 243 transition count 1538
Drop transitions (Redundant composition of simpler transitions.) removed 454 transitions
Redundant transition composition rules discarded 454 transitions
Iterating global reduction 10 with 454 rules applied. Total rules applied 4609 place count 243 transition count 1084
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 4618 place count 243 transition count 1084
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 4623 place count 243 transition count 1079
Applied a total of 4623 rules in 2774 ms. Remains 243 /2443 variables (removed 2200) and now considering 1079/15956 (removed 14877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2784 ms. Remains : 243/2443 places, 1079/15956 transitions.
RANDOM walk for 40000 steps (1589 resets) in 1368 ms. (29 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (166 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (162 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (167 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (170 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (166 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (174 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (175 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 622916 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :0 out of 7
Probabilistic random walk after 622916 steps, saw 106116 distinct states, run finished after 3010 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 1079 rows 243 cols
[2024-05-29 14:15:57] [INFO ] Computed 9 invariants in 10 ms
[2024-05-29 14:15:57] [INFO ] State equation strengthened by 694 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1322 variables, 243/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1322 variables, 694/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1322 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1322 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 946 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 694/694 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 143/243 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
[2024-05-29 14:15:59] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 2 ms to minimize.
[2024-05-29 14:16:00] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2024-05-29 14:16:00] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 2 ms to minimize.
[2024-05-29 14:16:00] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 1 ms to minimize.
[2024-05-29 14:16:00] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 1 ms to minimize.
[2024-05-29 14:16:01] [INFO ] Deduced a trap composed of 38 places in 285 ms of which 3 ms to minimize.
[2024-05-29 14:16:01] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 2 ms to minimize.
[2024-05-29 14:16:01] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:16:01] [INFO ] Deduced a trap composed of 40 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:16:02] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 2 ms to minimize.
[2024-05-29 14:16:02] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:16:02] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 2 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 48 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-07b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 16/25 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 14:16:03] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 14:16:04] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2024-05-29 14:16:04] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:16:04] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1079/1322 variables, 243/272 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1322 variables, 694/966 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1322 variables, 6/972 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 14:16:05] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 1 ms to minimize.
[2024-05-29 14:16:06] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:16:06] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1322 variables, 3/975 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1322 variables, 0/975 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 14:16:07] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 3 ms to minimize.
[2024-05-29 14:16:07] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 2 ms to minimize.
[2024-05-29 14:16:08] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 2 ms to minimize.
[2024-05-29 14:16:08] [INFO ] Deduced a trap composed of 32 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:16:08] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 1 ms to minimize.
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 2 ms to minimize.
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 1 ms to minimize.
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:16:09] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2024-05-29 14:16:10] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1322 variables, 11/986 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 1 ms to minimize.
[2024-05-29 14:16:11] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:16:12] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:16:12] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1322 variables, 4/990 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-29 14:16:13] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1322 variables, 1/991 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1322 variables, 0/991 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1322 variables, 0/991 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1322/1322 variables, and 991 constraints, problems are : Problem set: 1 solved, 6 unsolved in 15066 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 694/694 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 39/39 constraints]
After SMT, in 16629ms problems are : Problem set: 1 solved, 6 unsolved
Parikh walk visited 0 properties in 1577 ms.
Support contains 71 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 1079/1079 transitions.
Graph (trivial) has 64 edges and 243 vertex of which 2 / 243 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 242 transition count 1052
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 31 rules applied. Total rules applied 57 place count 217 transition count 1046
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 213 transition count 1046
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 61 place count 213 transition count 1044
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 211 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 209 transition count 1042
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 209 transition count 1042
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 85 place count 201 transition count 1034
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 94 place count 201 transition count 1025
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 98 place count 197 transition count 1021
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 197 transition count 1021
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 108 place count 197 transition count 1015
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 113 place count 197 transition count 1010
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 119 place count 197 transition count 1004
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 125 place count 191 transition count 1004
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 127 place count 191 transition count 1004
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 191 transition count 1002
Applied a total of 129 rules in 354 ms. Remains 191 /243 variables (removed 52) and now considering 1002/1079 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 191/243 places, 1002/1079 transitions.
RANDOM walk for 40000 steps (1613 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (180 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (200 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (182 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (183 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (189 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (189 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 665941 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 6
Probabilistic random walk after 665941 steps, saw 118366 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
// Phase 1: matrix 1002 rows 191 cols
[2024-05-29 14:16:19] [INFO ] Computed 9 invariants in 7 ms
[2024-05-29 14:16:19] [INFO ] State equation strengthened by 693 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 120/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1002/1193 variables, 191/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1193 variables, 693/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1193 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/1193 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1193/1193 variables, and 893 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 191/191 constraints, ReadFeed: 693/693 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 120/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:20] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 1 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 1 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2024-05-29 14:16:21] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 0 ms to minimize.
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:22] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 2 ms to minimize.
[2024-05-29 14:16:23] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 1 ms to minimize.
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:24] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:25] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2024-05-29 14:16:25] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2024-05-29 14:16:25] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1002/1193 variables, 191/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1193 variables, 693/916 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1193 variables, 6/922 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1193 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:27] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1193 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:27] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:16:27] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1193 variables, 2/925 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 14:16:28] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 2 ms to minimize.
[2024-05-29 14:16:28] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1193 variables, 2/927 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1193 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1193 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1193/1193 variables, and 927 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 191/191 constraints, ReadFeed: 693/693 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 11091ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2062 ms.
Support contains 71 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 1002/1002 transitions.
Applied a total of 0 rules in 58 ms. Remains 191 /191 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 191/191 places, 1002/1002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 1002/1002 transitions.
Applied a total of 0 rules in 59 ms. Remains 191 /191 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2024-05-29 14:16:32] [INFO ] Invariant cache hit.
[2024-05-29 14:16:32] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-29 14:16:32] [INFO ] Invariant cache hit.
[2024-05-29 14:16:33] [INFO ] State equation strengthened by 693 read => feed constraints.
[2024-05-29 14:16:34] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2024-05-29 14:16:34] [INFO ] Redundant transitions in 58 ms returned []
Running 990 sub problems to find dead transitions.
[2024-05-29 14:16:34] [INFO ] Invariant cache hit.
[2024-05-29 14:16:34] [INFO ] State equation strengthened by 693 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 990 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 990 unsolved
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 1 ms to minimize.
[2024-05-29 14:16:54] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 1 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2024-05-29 14:16:55] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 0 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:16:56] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 1 ms to minimize.
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:16:57] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:16:58] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 990 unsolved
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:16:59] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:17:00] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2024-05-29 14:17:01] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 1 ms to minimize.
[2024-05-29 14:17:01] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 1 ms to minimize.
[2024-05-29 14:17:01] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2024-05-29 14:17:02] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 1 ms to minimize.
[2024-05-29 14:17:02] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:17:02] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2024-05-29 14:17:02] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 1 ms to minimize.
[2024-05-29 14:17:03] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 2 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2024-05-29 14:17:04] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 990 unsolved
[2024-05-29 14:17:08] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:17:09] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 1 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 1 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:17:10] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 38 places in 263 ms of which 1 ms to minimize.
[2024-05-29 14:17:11] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 52 places in 239 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 1 ms to minimize.
[2024-05-29 14:17:12] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:17:13] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 990 unsolved
[2024-05-29 14:17:14] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 0 ms to minimize.
[2024-05-29 14:17:14] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 1 ms to minimize.
[2024-05-29 14:17:15] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 2 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:17:16] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 1 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 38 places in 289 ms of which 2 ms to minimize.
[2024-05-29 14:17:17] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 1 ms to minimize.
SMT process timed out in 43561ms, After SMT, problems are : Problem set: 0 solved, 990 unsolved
Search for dead transitions found 0 dead transitions in 43579ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45113 ms. Remains : 191/191 places, 1002/1002 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 191 transition count 985
Reduce places removed 17 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 27 rules applied. Total rules applied 44 place count 174 transition count 975
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 54 place count 164 transition count 975
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 164 transition count 974
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 163 transition count 974
Performed 11 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 78 place count 152 transition count 958
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 90 place count 152 transition count 946
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 150 transition count 944
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 99 place count 150 transition count 939
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 150 transition count 932
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 113 place count 143 transition count 932
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 143 transition count 931
Applied a total of 114 rules in 162 ms. Remains 143 /191 variables (removed 48) and now considering 931/1002 (removed 71) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 931 rows 143 cols
[2024-05-29 14:17:18] [INFO ] Computed 9 invariants in 11 ms
[2024-05-29 14:17:18] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 14:17:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 14:17:18] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-29 14:17:18] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2024-05-29 14:17:19] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
TRAPS : Iteration 1
[2024-05-29 14:17:19] [INFO ] After 1697ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-29 14:17:20] [INFO ] After 1994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 2257 ms.
[2024-05-29 14:17:20] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 14:17:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 191 places, 1002 transitions and 13030 arcs took 17 ms.
[2024-05-29 14:17:20] [INFO ] Flatten gal took : 229 ms
Total runtime 104152 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-07b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 191
TRANSITIONS: 1002
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.056s, Sys 0.004s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 1025
MODEL NAME: /home/mcc/execution/412/model
191 places, 1002 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.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716992274018

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML

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="StigmergyCommit-PT-07b"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-07b, 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 r399-tall-171690529800182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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