fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r522-tall-167987247100273
Last Updated
May 14, 2023

About the Execution of Marcie+red for EisenbergMcGuire-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6323.884 3600000.00 3659482.00 8527.80 ??????TT??F??T?T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247100273.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-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 3.1M 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-10-CTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680835436955

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-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 02:43:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 02:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:43:58] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-04-07 02:43:58] [INFO ] Transformed 1090 places.
[2023-04-07 02:43:58] [INFO ] Transformed 5200 transitions.
[2023-04-07 02:43:58] [INFO ] Found NUPN structural information;
[2023-04-07 02:43:58] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 83 place count 1007 transition count 4370
Iterating global reduction 0 with 83 rules applied. Total rules applied 166 place count 1007 transition count 4370
Applied a total of 166 rules in 174 ms. Remains 1007 /1090 variables (removed 83) and now considering 4370/5200 (removed 830) transitions.
[2023-04-07 02:43:59] [INFO ] Flow matrix only has 1500 transitions (discarded 2870 similar events)
// Phase 1: matrix 1500 rows 1007 cols
[2023-04-07 02:43:59] [INFO ] Computed 31 invariants in 31 ms
[2023-04-07 02:44:00] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-04-07 02:44:00] [INFO ] Flow matrix only has 1500 transitions (discarded 2870 similar events)
[2023-04-07 02:44:00] [INFO ] Invariant cache hit.
[2023-04-07 02:44:00] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-04-07 02:44:06] [INFO ] Implicit Places using invariants and state equation in 6215 ms returned []
Implicit Place search using SMT with State Equation took 7124 ms to find 0 implicit places.
[2023-04-07 02:44:06] [INFO ] Flow matrix only has 1500 transitions (discarded 2870 similar events)
[2023-04-07 02:44:06] [INFO ] Invariant cache hit.
[2023-04-07 02:44:07] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1007/1090 places, 4370/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8688 ms. Remains : 1007/1090 places, 4370/5200 transitions.
Support contains 112 out of 1007 places after structural reductions.
[2023-04-07 02:44:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-07 02:44:08] [INFO ] Flatten gal took : 251 ms
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 02:44:08] [INFO ] Flatten gal took : 152 ms
[2023-04-07 02:44:08] [INFO ] Input system was already deterministic with 4370 transitions.
Support contains 95 out of 1007 places (down from 112) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 49) seen :28
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-04-07 02:44:09] [INFO ] Flow matrix only has 1500 transitions (discarded 2870 similar events)
[2023-04-07 02:44:09] [INFO ] Invariant cache hit.
[2023-04-07 02:44:09] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-04-07 02:44:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 33 ms returned sat
[2023-04-07 02:44:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 18 ms returned sat
[2023-04-07 02:44:12] [INFO ] After 1362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-04-07 02:44:12] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-04-07 02:44:13] [INFO ] After 1463ms SMT Verify possible using 499 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-04-07 02:44:13] [INFO ] Deduced a trap composed of 87 places in 291 ms of which 6 ms to minimize.
[2023-04-07 02:44:14] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 1 ms to minimize.
[2023-04-07 02:44:14] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 0 ms to minimize.
[2023-04-07 02:44:14] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 1 ms to minimize.
[2023-04-07 02:44:15] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 0 ms to minimize.
[2023-04-07 02:44:15] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 0 ms to minimize.
[2023-04-07 02:44:15] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 1 ms to minimize.
[2023-04-07 02:44:15] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 1 ms to minimize.
[2023-04-07 02:44:16] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 1 ms to minimize.
[2023-04-07 02:44:16] [INFO ] Deduced a trap composed of 104 places in 240 ms of which 0 ms to minimize.
[2023-04-07 02:44:16] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 0 ms to minimize.
[2023-04-07 02:44:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3315 ms
[2023-04-07 02:44:17] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-04-07 02:44:17] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 1 ms to minimize.
[2023-04-07 02:44:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2023-04-07 02:44:17] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-04-07 02:44:17] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:44:18] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-04-07 02:44:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 617 ms
[2023-04-07 02:44:18] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-07 02:44:18] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2023-04-07 02:44:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2023-04-07 02:44:19] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 1 ms to minimize.
[2023-04-07 02:44:19] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 0 ms to minimize.
[2023-04-07 02:44:19] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-04-07 02:44:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 857 ms
[2023-04-07 02:44:19] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-04-07 02:44:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-04-07 02:44:20] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2023-04-07 02:44:20] [INFO ] Deduced a trap composed of 26 places in 399 ms of which 0 ms to minimize.
[2023-04-07 02:44:21] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2023-04-07 02:44:21] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 1 ms to minimize.
[2023-04-07 02:44:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1393 ms
[2023-04-07 02:44:22] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-07 02:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-04-07 02:44:22] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 1 ms to minimize.
[2023-04-07 02:44:22] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 1 ms to minimize.
[2023-04-07 02:44:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-04-07 02:44:22] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 0 ms to minimize.
[2023-04-07 02:44:23] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 1 ms to minimize.
[2023-04-07 02:44:23] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2023-04-07 02:44:23] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 1 ms to minimize.
[2023-04-07 02:44:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 862 ms
[2023-04-07 02:44:24] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 1 ms to minimize.
[2023-04-07 02:44:24] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2023-04-07 02:44:24] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-04-07 02:44:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 547 ms
[2023-04-07 02:44:24] [INFO ] After 12487ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 1472 ms.
[2023-04-07 02:44:26] [INFO ] After 16231ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 1 properties in 696 ms.
Support contains 37 out of 1007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1007 transition count 4360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 997 transition count 4360
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 20 place count 997 transition count 4067
Deduced a syphon composed of 293 places in 6 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 606 place count 704 transition count 4067
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 611 place count 699 transition count 4017
Iterating global reduction 2 with 5 rules applied. Total rules applied 616 place count 699 transition count 4017
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 10 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 780 place count 617 transition count 3935
Applied a total of 780 rules in 451 ms. Remains 617 /1007 variables (removed 390) and now considering 3935/4370 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 617/1007 places, 3935/4370 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Interrupted probabilistic random walk after 142340 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{1=1, 2=1, 3=1, 4=1, 6=1, 9=1, 11=1, 13=1, 14=1, 15=1}
Probabilistic random walk after 142340 steps, saw 102785 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :10
Running SMT prover for 9 properties.
[2023-04-07 02:44:30] [INFO ] Flow matrix only has 1065 transitions (discarded 2870 similar events)
// Phase 1: matrix 1065 rows 617 cols
[2023-04-07 02:44:30] [INFO ] Computed 31 invariants in 13 ms
[2023-04-07 02:44:30] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 02:44:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 02:44:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 02:44:31] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 02:44:31] [INFO ] State equation strengthened by 454 read => feed constraints.
[2023-04-07 02:44:31] [INFO ] After 458ms SMT Verify possible using 454 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 02:44:32] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 1 ms to minimize.
[2023-04-07 02:44:32] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2023-04-07 02:44:32] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-04-07 02:44:32] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-07 02:44:32] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 02:44:32] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2023-04-07 02:44:33] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-04-07 02:44:33] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2023-04-07 02:44:33] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-04-07 02:44:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1550 ms
[2023-04-07 02:44:33] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:44:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-04-07 02:44:33] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-04-07 02:44:33] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2023-04-07 02:44:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-07 02:44:34] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-04-07 02:44:34] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 02:44:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2023-04-07 02:44:34] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-04-07 02:44:34] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-04-07 02:44:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-04-07 02:44:34] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2023-04-07 02:44:35] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-04-07 02:44:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-04-07 02:44:35] [INFO ] After 3682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-04-07 02:44:35] [INFO ] After 4799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 62 ms.
Support contains 16 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 3935/3935 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 617 transition count 3922
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 604 transition count 3922
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 602 transition count 3902
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 602 transition count 3902
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 597 transition count 3897
Applied a total of 40 rules in 276 ms. Remains 597 /617 variables (removed 20) and now considering 3897/3935 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 597/617 places, 3897/3935 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-07 02:44:36] [INFO ] Flow matrix only has 1027 transitions (discarded 2870 similar events)
// Phase 1: matrix 1027 rows 597 cols
[2023-04-07 02:44:36] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 02:44:36] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 02:44:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 02:44:36] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 02:44:37] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 02:44:37] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 02:44:37] [INFO ] After 360ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 02:44:37] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 0 ms to minimize.
[2023-04-07 02:44:38] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-04-07 02:44:38] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 1 ms to minimize.
[2023-04-07 02:44:38] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2023-04-07 02:44:38] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 1 ms to minimize.
[2023-04-07 02:44:38] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2023-04-07 02:44:38] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1627 ms
[2023-04-07 02:44:39] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-04-07 02:44:39] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-04-07 02:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-07 02:44:40] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 02:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 02:44:40] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:44:40] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-04-07 02:44:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 267 ms
[2023-04-07 02:44:40] [INFO ] After 3308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-04-07 02:44:40] [INFO ] After 4351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 26 ms.
Support contains 15 out of 597 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 597/597 places, 3897/3897 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 596 transition count 3896
Applied a total of 2 rules in 523 ms. Remains 596 /597 variables (removed 1) and now considering 3896/3897 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 596/597 places, 3896/3897 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 148126 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148126 steps, saw 105430 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-07 02:44:44] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
// Phase 1: matrix 1026 rows 596 cols
[2023-04-07 02:44:44] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 02:44:45] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 02:44:45] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 02:44:45] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 02:44:45] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 02:44:45] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 02:44:46] [INFO ] After 367ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 02:44:46] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 1 ms to minimize.
[2023-04-07 02:44:46] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 1 ms to minimize.
[2023-04-07 02:44:46] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-04-07 02:44:46] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 0 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 0 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 0 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 02:44:47] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:44:48] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2023-04-07 02:44:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2034 ms
[2023-04-07 02:44:48] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 02:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-07 02:44:48] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-04-07 02:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-07 02:44:48] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-07 02:44:48] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2023-04-07 02:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-07 02:44:49] [INFO ] After 3376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 343 ms.
[2023-04-07 02:44:49] [INFO ] After 4383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 23 ms.
Support contains 15 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3896/3896 transitions.
Applied a total of 0 rules in 131 ms. Remains 596 /596 variables (removed 0) and now considering 3896/3896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 596/596 places, 3896/3896 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 3896/3896 transitions.
Applied a total of 0 rules in 132 ms. Remains 596 /596 variables (removed 0) and now considering 3896/3896 (removed 0) transitions.
[2023-04-07 02:44:49] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2023-04-07 02:44:49] [INFO ] Invariant cache hit.
[2023-04-07 02:44:50] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-04-07 02:44:50] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2023-04-07 02:44:50] [INFO ] Invariant cache hit.
[2023-04-07 02:44:50] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 02:44:54] [INFO ] Implicit Places using invariants and state equation in 3821 ms returned []
Implicit Place search using SMT with State Equation took 4453 ms to find 0 implicit places.
[2023-04-07 02:44:54] [INFO ] Redundant transitions in 233 ms returned []
[2023-04-07 02:44:54] [INFO ] Flow matrix only has 1026 transitions (discarded 2870 similar events)
[2023-04-07 02:44:54] [INFO ] Invariant cache hit.
[2023-04-07 02:44:55] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6020 ms. Remains : 596/596 places, 3896/3896 transitions.
Graph (trivial) has 3590 edges and 596 vertex of which 100 / 596 are part of one of the 10 SCC in 4 ms
Free SCC test removed 90 places
Drop transitions removed 348 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3138 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 506 transition count 642
Reduce places removed 116 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 390 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 389 transition count 641
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 235 place count 389 transition count 623
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 279 place count 363 transition count 623
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 619 place count 193 transition count 453
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 705 place count 193 transition count 367
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 719 place count 186 transition count 375
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 725 place count 186 transition count 369
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 733 place count 186 transition count 361
Free-agglomeration rule applied 88 times.
Iterating global reduction 5 with 88 rules applied. Total rules applied 821 place count 186 transition count 273
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 5 with 88 rules applied. Total rules applied 909 place count 98 transition count 273
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 918 place count 98 transition count 273
Applied a total of 918 rules in 67 ms. Remains 98 /596 variables (removed 498) and now considering 273/3896 (removed 3623) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 273 rows 98 cols
[2023-04-07 02:44:55] [INFO ] Computed 23 invariants in 1 ms
[2023-04-07 02:44:55] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-07 02:44:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-07 02:44:55] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-07 02:44:55] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-07 02:44:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 02:44:55] [INFO ] After 68ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-07 02:44:55] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 02:44:56] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-04-07 02:44:56] [INFO ] Flatten gal took : 112 ms
[2023-04-07 02:44:56] [INFO ] Flatten gal took : 122 ms
[2023-04-07 02:44:56] [INFO ] Input system was already deterministic with 4370 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1000 transition count 4300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1000 transition count 4300
Applied a total of 14 rules in 50 ms. Remains 1000 /1007 variables (removed 7) and now considering 4300/4370 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1000/1007 places, 4300/4370 transitions.
[2023-04-07 02:44:56] [INFO ] Flatten gal took : 97 ms
[2023-04-07 02:44:56] [INFO ] Flatten gal took : 107 ms
[2023-04-07 02:44:57] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1000 transition count 4300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1000 transition count 4300
Applied a total of 14 rules in 54 ms. Remains 1000 /1007 variables (removed 7) and now considering 4300/4370 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1000/1007 places, 4300/4370 transitions.
[2023-04-07 02:44:57] [INFO ] Flatten gal took : 93 ms
[2023-04-07 02:44:57] [INFO ] Flatten gal took : 111 ms
[2023-04-07 02:44:57] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1000 transition count 4300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1000 transition count 4300
Applied a total of 14 rules in 53 ms. Remains 1000 /1007 variables (removed 7) and now considering 4300/4370 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1000/1007 places, 4300/4370 transitions.
[2023-04-07 02:44:57] [INFO ] Flatten gal took : 91 ms
[2023-04-07 02:44:57] [INFO ] Flatten gal took : 105 ms
[2023-04-07 02:44:58] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1001 transition count 4310
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1001 transition count 4310
Applied a total of 12 rules in 49 ms. Remains 1001 /1007 variables (removed 6) and now considering 4310/4370 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 1001/1007 places, 4310/4370 transitions.
[2023-04-07 02:44:58] [INFO ] Flatten gal took : 90 ms
[2023-04-07 02:44:58] [INFO ] Flatten gal took : 106 ms
[2023-04-07 02:44:58] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1007 transition count 4360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 997 transition count 4360
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 997 transition count 4052
Deduced a syphon composed of 308 places in 3 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 689 transition count 4052
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 642 place count 683 transition count 3992
Iterating global reduction 2 with 6 rules applied. Total rules applied 648 place count 683 transition count 3992
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 828 place count 593 transition count 3902
Applied a total of 828 rules in 342 ms. Remains 593 /1007 variables (removed 414) and now considering 3902/4370 (removed 468) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 342 ms. Remains : 593/1007 places, 3902/4370 transitions.
[2023-04-07 02:44:59] [INFO ] Flatten gal took : 77 ms
[2023-04-07 02:44:59] [INFO ] Flatten gal took : 87 ms
[2023-04-07 02:44:59] [INFO ] Input system was already deterministic with 3902 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1001 transition count 4310
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1001 transition count 4310
Applied a total of 12 rules in 47 ms. Remains 1001 /1007 variables (removed 6) and now considering 4310/4370 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 1001/1007 places, 4310/4370 transitions.
[2023-04-07 02:44:59] [INFO ] Flatten gal took : 81 ms
[2023-04-07 02:44:59] [INFO ] Flatten gal took : 92 ms
[2023-04-07 02:44:59] [INFO ] Input system was already deterministic with 4310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1007 transition count 4360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 997 transition count 4360
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 997 transition count 4051
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 688 transition count 4051
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 645 place count 681 transition count 3981
Iterating global reduction 2 with 7 rules applied. Total rules applied 652 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 832 place count 591 transition count 3891
Applied a total of 832 rules in 238 ms. Remains 591 /1007 variables (removed 416) and now considering 3891/4370 (removed 479) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 238 ms. Remains : 591/1007 places, 3891/4370 transitions.
[2023-04-07 02:45:00] [INFO ] Flatten gal took : 75 ms
[2023-04-07 02:45:00] [INFO ] Flatten gal took : 90 ms
[2023-04-07 02:45:00] [INFO ] Input system was already deterministic with 3891 transitions.
Finished random walk after 1050 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=210 )
FORMULA EisenbergMcGuire-PT-10-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1007 transition count 4360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 997 transition count 4360
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 20 place count 997 transition count 4060
Deduced a syphon composed of 300 places in 3 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 620 place count 697 transition count 4060
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 625 place count 692 transition count 4010
Iterating global reduction 2 with 5 rules applied. Total rules applied 630 place count 692 transition count 4010
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 806 place count 604 transition count 3922
Applied a total of 806 rules in 239 ms. Remains 604 /1007 variables (removed 403) and now considering 3922/4370 (removed 448) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 239 ms. Remains : 604/1007 places, 3922/4370 transitions.
[2023-04-07 02:45:00] [INFO ] Flatten gal took : 75 ms
[2023-04-07 02:45:00] [INFO ] Flatten gal took : 85 ms
[2023-04-07 02:45:00] [INFO ] Input system was already deterministic with 3922 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1007 transition count 4360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 997 transition count 4360
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 303 Pre rules applied. Total rules applied 20 place count 997 transition count 4057
Deduced a syphon composed of 303 places in 3 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 2 with 606 rules applied. Total rules applied 626 place count 694 transition count 4057
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 633 place count 687 transition count 3987
Iterating global reduction 2 with 7 rules applied. Total rules applied 640 place count 687 transition count 3987
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 816 place count 599 transition count 3899
Applied a total of 816 rules in 227 ms. Remains 599 /1007 variables (removed 408) and now considering 3899/4370 (removed 471) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 230 ms. Remains : 599/1007 places, 3899/4370 transitions.
[2023-04-07 02:45:01] [INFO ] Flatten gal took : 75 ms
[2023-04-07 02:45:01] [INFO ] Flatten gal took : 87 ms
[2023-04-07 02:45:01] [INFO ] Input system was already deterministic with 3899 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1000 transition count 4300
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1000 transition count 4300
Applied a total of 14 rules in 46 ms. Remains 1000 /1007 variables (removed 7) and now considering 4300/4370 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 1000/1007 places, 4300/4370 transitions.
[2023-04-07 02:45:01] [INFO ] Flatten gal took : 81 ms
[2023-04-07 02:45:01] [INFO ] Flatten gal took : 94 ms
[2023-04-07 02:45:01] [INFO ] Input system was already deterministic with 4300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1007 transition count 4360
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 997 transition count 4360
Performed 305 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 305 Pre rules applied. Total rules applied 20 place count 997 transition count 4055
Deduced a syphon composed of 305 places in 3 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 2 with 610 rules applied. Total rules applied 630 place count 692 transition count 4055
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 636 place count 686 transition count 3995
Iterating global reduction 2 with 6 rules applied. Total rules applied 642 place count 686 transition count 3995
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 3 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 812 place count 601 transition count 3910
Applied a total of 812 rules in 226 ms. Remains 601 /1007 variables (removed 406) and now considering 3910/4370 (removed 460) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 228 ms. Remains : 601/1007 places, 3910/4370 transitions.
[2023-04-07 02:45:02] [INFO ] Flatten gal took : 74 ms
[2023-04-07 02:45:02] [INFO ] Flatten gal took : 86 ms
[2023-04-07 02:45:02] [INFO ] Input system was already deterministic with 3910 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1007/1007 places, 4370/4370 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1001 transition count 4310
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1001 transition count 4310
Applied a total of 12 rules in 55 ms. Remains 1001 /1007 variables (removed 6) and now considering 4310/4370 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 1001/1007 places, 4310/4370 transitions.
[2023-04-07 02:45:02] [INFO ] Flatten gal took : 87 ms
[2023-04-07 02:45:02] [INFO ] Flatten gal took : 102 ms
[2023-04-07 02:45:03] [INFO ] Input system was already deterministic with 4310 transitions.
[2023-04-07 02:45:03] [INFO ] Flatten gal took : 92 ms
[2023-04-07 02:45:03] [INFO ] Flatten gal took : 94 ms
[2023-04-07 02:45:03] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-04-07 02:45:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1007 places, 4370 transitions and 22080 arcs took 23 ms.
Total runtime 64853 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: 1007 NrTr: 4370 NrArc: 22080)

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

net check time: 0m 0.002sec

init dd package: 0m 2.905sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9824332 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097388 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.041sec

41968 92877 143565 145186 170994 444500 565268 620987 757438 830854 819562 873482 1551779

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-10"
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-10, 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-167987247100273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 ;