Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247100257.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is EisenbergMcGuire-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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 EisenbergMcGuire-PT-08-CTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680828471903

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 00:47:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 00:47:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:47:53] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-04-07 00:47:53] [INFO ] Transformed 712 places.
[2023-04-07 00:47:53] [INFO ] Transformed 2816 transitions.
[2023-04-07 00:47:53] [INFO ] Found NUPN structural information;
[2023-04-07 00:47:53] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
FORMULA EisenbergMcGuire-PT-08-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 663 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 663 transition count 2424
Applied a total of 98 rules in 106 ms. Remains 663 /712 variables (removed 49) and now considering 2424/2816 (removed 392) transitions.
[2023-04-07 00:47:53] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
// Phase 1: matrix 976 rows 663 cols
[2023-04-07 00:47:53] [INFO ] Computed 25 invariants in 15 ms
[2023-04-07 00:47:54] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-04-07 00:47:54] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2023-04-07 00:47:54] [INFO ] Invariant cache hit.
[2023-04-07 00:47:54] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-04-07 00:47:57] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 3203 ms to find 0 implicit places.
[2023-04-07 00:47:57] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2023-04-07 00:47:57] [INFO ] Invariant cache hit.
[2023-04-07 00:47:57] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 663/712 places, 2424/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4117 ms. Remains : 663/712 places, 2424/2816 transitions.
Support contains 110 out of 663 places after structural reductions.
[2023-04-07 00:47:58] [INFO ] Flatten gal took : 157 ms
[2023-04-07 00:47:58] [INFO ] Flatten gal took : 119 ms
[2023-04-07 00:47:58] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 107 out of 663 places (down from 110) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 62) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-04-07 00:47:59] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2023-04-07 00:47:59] [INFO ] Invariant cache hit.
[2023-04-07 00:47:59] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-04-07 00:47:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-07 00:47:59] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 00:48:01] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-04-07 00:48:01] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-04-07 00:48:02] [INFO ] After 1323ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 4 ms to minimize.
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-07 00:48:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 455 ms
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-07 00:48:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 322 ms
[2023-04-07 00:48:03] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2023-04-07 00:48:04] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 0 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-04-07 00:48:04] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 0 ms to minimize.
[2023-04-07 00:48:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-04-07 00:48:05] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:48:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-07 00:48:05] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 1 ms to minimize.
[2023-04-07 00:48:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-07 00:48:05] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2023-04-07 00:48:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-07 00:48:06] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-04-07 00:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 00:48:06] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2023-04-07 00:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-07 00:48:06] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 0 ms to minimize.
[2023-04-07 00:48:06] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2023-04-07 00:48:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-04-07 00:48:07] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2023-04-07 00:48:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-07 00:48:07] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2023-04-07 00:48:07] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 0 ms to minimize.
[2023-04-07 00:48:08] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 0 ms to minimize.
[2023-04-07 00:48:08] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2023-04-07 00:48:08] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2023-04-07 00:48:08] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 0 ms to minimize.
[2023-04-07 00:48:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 922 ms
[2023-04-07 00:48:08] [INFO ] After 7072ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :30
Attempting to minimize the solution found.
Minimization took 1312 ms.
[2023-04-07 00:48:09] [INFO ] After 10355ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :30
Fused 31 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 902 ms.
Support contains 50 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 176 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 176 Pre rules applied. Total rules applied 16 place count 655 transition count 2240
Deduced a syphon composed of 176 places in 2 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 368 place count 479 transition count 2240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 371 place count 476 transition count 2216
Iterating global reduction 2 with 3 rules applied. Total rules applied 374 place count 476 transition count 2216
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 472 place count 427 transition count 2167
Applied a total of 472 rules in 227 ms. Remains 427 /663 variables (removed 236) and now considering 2167/2424 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 427/663 places, 2167/2424 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2023-04-07 00:48:11] [INFO ] Flow matrix only has 719 transitions (discarded 1448 similar events)
// Phase 1: matrix 719 rows 427 cols
[2023-04-07 00:48:11] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 00:48:11] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-04-07 00:48:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-07 00:48:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 00:48:12] [INFO ] After 753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-04-07 00:48:12] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 00:48:13] [INFO ] After 753ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-04-07 00:48:13] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 00:48:13] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 4 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1113 ms
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2023-04-07 00:48:14] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-04-07 00:48:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-04-07 00:48:15] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-07 00:48:15] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2023-04-07 00:48:15] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2023-04-07 00:48:15] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-04-07 00:48:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2023-04-07 00:48:15] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 0 ms to minimize.
[2023-04-07 00:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-04-07 00:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2023-04-07 00:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2023-04-07 00:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2023-04-07 00:48:16] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 460 ms
[2023-04-07 00:48:17] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-07 00:48:17] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 00:48:17] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-04-07 00:48:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-07 00:48:18] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 0 ms to minimize.
[2023-04-07 00:48:18] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-04-07 00:48:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-04-07 00:48:18] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2023-04-07 00:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-07 00:48:18] [INFO ] After 5619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 812 ms.
[2023-04-07 00:48:19] [INFO ] After 7592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Fused 26 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 256 ms.
Support contains 45 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 2167/2167 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 427 transition count 2166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 426 transition count 2166
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 422 transition count 2162
Applied a total of 10 rules in 88 ms. Remains 422 /427 variables (removed 5) and now considering 2162/2167 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 422/427 places, 2162/2167 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 171630 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 17=1, 18=1, 21=1, 22=1, 23=1, 24=1, 25=1}
Probabilistic random walk after 171630 steps, saw 105014 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :20
Running SMT prover for 6 properties.
[2023-04-07 00:48:22] [INFO ] Flow matrix only has 714 transitions (discarded 1448 similar events)
// Phase 1: matrix 714 rows 422 cols
[2023-04-07 00:48:22] [INFO ] Computed 25 invariants in 13 ms
[2023-04-07 00:48:23] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 00:48:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 00:48:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2023-04-07 00:48:23] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 00:48:23] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 00:48:23] [INFO ] After 228ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 00:48:23] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-04-07 00:48:23] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 712 ms
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2023-04-07 00:48:24] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-07 00:48:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-07 00:48:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-04-07 00:48:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-07 00:48:25] [INFO ] After 1688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-04-07 00:48:25] [INFO ] After 2310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 22 ms.
Support contains 15 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 2162/2162 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 422 transition count 2145
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 405 transition count 2145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 403 transition count 2129
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 403 transition count 2129
Applied a total of 38 rules in 82 ms. Remains 403 /422 variables (removed 19) and now considering 2129/2162 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 403/422 places, 2129/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 235872 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{4=1}
Probabilistic random walk after 235872 steps, saw 142412 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :1
Running SMT prover for 5 properties.
[2023-04-07 00:48:28] [INFO ] Flow matrix only has 681 transitions (discarded 1448 similar events)
// Phase 1: matrix 681 rows 403 cols
[2023-04-07 00:48:28] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 00:48:28] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:48:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 00:48:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 00:48:29] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:48:29] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-07 00:48:29] [INFO ] After 174ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:48:29] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-07 00:48:29] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2023-04-07 00:48:29] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 00:48:29] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 00:48:29] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2023-04-07 00:48:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 585 ms
[2023-04-07 00:48:30] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 00:48:30] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2023-04-07 00:48:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2023-04-07 00:48:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 00:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-07 00:48:30] [INFO ] After 1350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-04-07 00:48:30] [INFO ] After 1857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 13 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 2129/2129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 403 transition count 2128
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 2128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 401 transition count 2120
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 401 transition count 2120
Applied a total of 4 rules in 80 ms. Remains 401 /403 variables (removed 2) and now considering 2120/2129 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 401/403 places, 2120/2129 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 238185 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238185 steps, saw 143386 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-07 00:48:33] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
// Phase 1: matrix 672 rows 401 cols
[2023-04-07 00:48:33] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 00:48:34] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:48:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 00:48:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-07 00:48:34] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:48:34] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 00:48:34] [INFO ] After 169ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:48:34] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 00:48:34] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 00:48:34] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 0 ms to minimize.
[2023-04-07 00:48:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 00:48:35] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2023-04-07 00:48:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 445 ms
[2023-04-07 00:48:35] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 00:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-07 00:48:35] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 00:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-07 00:48:35] [INFO ] After 994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-04-07 00:48:35] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10 ms.
Support contains 13 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 2120/2120 transitions.
Applied a total of 0 rules in 57 ms. Remains 401 /401 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 401/401 places, 2120/2120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 2120/2120 transitions.
Applied a total of 0 rules in 60 ms. Remains 401 /401 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
[2023-04-07 00:48:35] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2023-04-07 00:48:35] [INFO ] Invariant cache hit.
[2023-04-07 00:48:36] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-04-07 00:48:36] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2023-04-07 00:48:36] [INFO ] Invariant cache hit.
[2023-04-07 00:48:36] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 00:48:37] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2023-04-07 00:48:37] [INFO ] Redundant transitions in 122 ms returned []
[2023-04-07 00:48:37] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2023-04-07 00:48:37] [INFO ] Invariant cache hit.
[2023-04-07 00:48:38] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2860 ms. Remains : 401/401 places, 2120/2120 transitions.
Graph (trivial) has 1876 edges and 401 vertex of which 62 / 401 are part of one of the 8 SCC in 4 ms
Free SCC test removed 54 places
Drop transitions removed 204 transitions
Ensure Unique test removed 1410 transitions
Reduce isomorphic transitions removed 1614 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 347 transition count 432
Reduce places removed 74 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 152 place count 273 transition count 429
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 155 place count 270 transition count 429
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 155 place count 270 transition count 415
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 188 place count 251 transition count 415
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 212 rules applied. Total rules applied 400 place count 145 transition count 309
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 449 place count 145 transition count 260
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 457 place count 141 transition count 260
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 461 place count 141 transition count 256
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 472 place count 141 transition count 245
Free-agglomeration rule applied 62 times.
Iterating global reduction 5 with 62 rules applied. Total rules applied 534 place count 141 transition count 183
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 596 place count 79 transition count 183
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 602 place count 79 transition count 183
Applied a total of 602 rules in 46 ms. Remains 79 /401 variables (removed 322) and now considering 183/2120 (removed 1937) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 183 rows 79 cols
[2023-04-07 00:48:38] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 00:48:38] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 00:48:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 00:48:38] [INFO ] [Nat]Absence check using 17 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-07 00:48:38] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 00:48:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 00:48:38] [INFO ] After 27ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 00:48:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-04-07 00:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-07 00:48:38] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 00:48:38] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-04-07 00:48:38] [INFO ] Flatten gal took : 77 ms
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 76 ms
[2023-04-07 00:48:39] [INFO ] Input system was already deterministic with 2424 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 42 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 656/663 places, 2368/2424 transitions.
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 61 ms
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 66 ms
[2023-04-07 00:48:39] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 41 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 57 ms
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 60 ms
[2023-04-07 00:48:39] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 31 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 56 ms
[2023-04-07 00:48:39] [INFO ] Flatten gal took : 58 ms
[2023-04-07 00:48:40] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 33 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 56 ms
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 60 ms
[2023-04-07 00:48:40] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 20 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 48 ms
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 56 ms
[2023-04-07 00:48:40] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 24 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 656/663 places, 2368/2424 transitions.
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 45 ms
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 51 ms
[2023-04-07 00:48:40] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 24 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 47 ms
[2023-04-07 00:48:40] [INFO ] Flatten gal took : 52 ms
[2023-04-07 00:48:40] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 20 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 45 ms
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:48:41] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 655 transition count 2219
Deduced a syphon composed of 197 places in 1 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 458 transition count 2219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 416 place count 452 transition count 2171
Iterating global reduction 2 with 6 rules applied. Total rules applied 422 place count 452 transition count 2171
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 532 place count 397 transition count 2116
Applied a total of 532 rules in 145 ms. Remains 397 /663 variables (removed 266) and now considering 2116/2424 (removed 308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 146 ms. Remains : 397/663 places, 2116/2424 transitions.
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 40 ms
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 46 ms
[2023-04-07 00:48:41] [INFO ] Input system was already deterministic with 2116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 20 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 44 ms
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 51 ms
[2023-04-07 00:48:41] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 22 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 657/663 places, 2376/2424 transitions.
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 44 ms
[2023-04-07 00:48:41] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:48:41] [INFO ] Input system was already deterministic with 2376 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 126 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 128 ms. Remains : 392/663 places, 2104/2424 transitions.
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 40 ms
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 45 ms
[2023-04-07 00:48:42] [INFO ] Input system was already deterministic with 2104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 20 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 656/663 places, 2368/2424 transitions.
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 45 ms
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:48:42] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 21 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 656/663 places, 2368/2424 transitions.
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 50 ms
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 46 ms
[2023-04-07 00:48:42] [INFO ] Input system was already deterministic with 2368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 19 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 656/663 places, 2368/2424 transitions.
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 43 ms
[2023-04-07 00:48:42] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:48:42] [INFO ] Input system was already deterministic with 2368 transitions.
[2023-04-07 00:48:43] [INFO ] Flatten gal took : 50 ms
[2023-04-07 00:48:43] [INFO ] Flatten gal took : 49 ms
[2023-04-07 00:48:43] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-04-07 00:48:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 663 places, 2424 transitions and 11872 arcs took 12 ms.
Total runtime 49751 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 663 NrTr: 2424 NrArc: 11872)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.222sec

net check time: 0m 0.004sec

init dd package: 0m 2.668sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9772556 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102368 kB

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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.011sec

31028 65387 65174 81166 91558 272234 278278 265776 251141 415190 417430 462084 497891 505629 542513 610802 641207 627699 660937 688450 714415 759829 1479363

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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is EisenbergMcGuire-PT-08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247100257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;