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-167987247100234.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-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 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 460K 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-05-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680820972932

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:42:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:42:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:42:54] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-04-06 22:42:54] [INFO ] Transformed 295 places.
[2023-04-06 22:42:54] [INFO ] Transformed 800 transitions.
[2023-04-06 22:42:54] [INFO ] Found NUPN structural information;
[2023-04-06 22:42:54] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 115 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 770
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 770
Applied a total of 12 rules in 48 ms. Remains 289 /295 variables (removed 6) and now considering 770/800 (removed 30) transitions.
[2023-04-06 22:42:54] [INFO ] Flow matrix only has 435 transitions (discarded 335 similar events)
// Phase 1: matrix 435 rows 289 cols
[2023-04-06 22:42:54] [INFO ] Computed 16 invariants in 23 ms
[2023-04-06 22:42:55] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-04-06 22:42:55] [INFO ] Flow matrix only has 435 transitions (discarded 335 similar events)
[2023-04-06 22:42:55] [INFO ] Invariant cache hit.
[2023-04-06 22:42:55] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-04-06 22:42:55] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2023-04-06 22:42:55] [INFO ] Flow matrix only has 435 transitions (discarded 335 similar events)
[2023-04-06 22:42:55] [INFO ] Invariant cache hit.
[2023-04-06 22:42:55] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/295 places, 770/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1067 ms. Remains : 289/295 places, 770/800 transitions.
Support contains 115 out of 289 places after structural reductions.
[2023-04-06 22:42:55] [INFO ] Flatten gal took : 71 ms
[2023-04-06 22:42:55] [INFO ] Flatten gal took : 43 ms
[2023-04-06 22:42:56] [INFO ] Input system was already deterministic with 770 transitions.
Support contains 109 out of 289 places (down from 115) 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 99) seen :32
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 67) 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 67) 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 67) 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 67) 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 67) 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 67) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) 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 66) seen :0
Running SMT prover for 66 properties.
[2023-04-06 22:42:56] [INFO ] Flow matrix only has 435 transitions (discarded 335 similar events)
[2023-04-06 22:42:56] [INFO ] Invariant cache hit.
[2023-04-06 22:42:57] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 22:42:57] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:42:57] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:64
[2023-04-06 22:42:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-06 22:42:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:42:59] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :62
[2023-04-06 22:42:59] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-04-06 22:43:00] [INFO ] After 1274ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :4 sat :62
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 6 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-06 22:43:01] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 609 ms
[2023-04-06 22:43:02] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-04-06 22:43:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:43:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2023-04-06 22:43:03] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 22:43:04] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-04-06 22:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 22:43:05] [INFO ] After 5538ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :61
Attempting to minimize the solution found.
Minimization took 1362 ms.
[2023-04-06 22:43:06] [INFO ] After 8605ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :61
Fused 66 Parikh solutions to 60 different solutions.
Parikh walk visited 1 properties in 1286 ms.
Support contains 68 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 770/770 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 289 transition count 768
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 287 transition count 768
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 4 place count 287 transition count 705
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 130 place count 224 transition count 705
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 218 transition count 675
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 218 transition count 675
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 182 place count 198 transition count 655
Applied a total of 182 rules in 91 ms. Remains 198 /289 variables (removed 91) and now considering 655/770 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 198/289 places, 655/770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 60) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 59) 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 59) 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 59) 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 59) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) 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 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) seen :0
Interrupted probabilistic random walk after 374118 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{0=1, 3=1, 4=1, 8=1, 15=1, 16=1, 19=1, 20=1, 21=1, 24=1, 26=1, 27=1, 30=1, 32=1, 34=1, 35=1, 36=1, 37=1, 38=1, 41=1, 44=1, 47=1, 48=1, 51=1, 52=1, 55=1}
Probabilistic random walk after 374118 steps, saw 99202 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :26
Running SMT prover for 31 properties.
[2023-04-06 22:43:11] [INFO ] Flow matrix only has 320 transitions (discarded 335 similar events)
// Phase 1: matrix 320 rows 198 cols
[2023-04-06 22:43:11] [INFO ] Computed 16 invariants in 5 ms
[2023-04-06 22:43:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:43:11] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:43:12] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-04-06 22:43:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-06 22:43:12] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:43:12] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-04-06 22:43:12] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-04-06 22:43:13] [INFO ] After 468ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :31
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 194 ms
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2023-04-06 22:43:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2023-04-06 22:43:13] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 314 ms
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 22:43:14] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-04-06 22:43:15] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 0 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 316 ms
[2023-04-06 22:43:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-04-06 22:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 22:43:15] [INFO ] After 3018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 591 ms.
[2023-04-06 22:43:16] [INFO ] After 4308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 0 properties in 257 ms.
Support contains 41 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 655/655 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 198 transition count 642
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 185 transition count 642
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 178 transition count 607
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 178 transition count 607
Applied a total of 40 rules in 43 ms. Remains 178 /198 variables (removed 20) and now considering 607/655 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 178/198 places, 607/655 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) 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 7 ms. (steps per millisecond=143 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 31) 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 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 7 ms. (steps per millisecond=143 ) properties (out of 31) 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 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 7 ms. (steps per millisecond=143 ) 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 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 7 ms. (steps per millisecond=143 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Interrupted probabilistic random walk after 469260 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{3=1, 7=1, 12=1, 13=1, 15=1, 16=1, 17=1, 24=1}
Probabilistic random walk after 469260 steps, saw 96918 distinct states, run finished after 3004 ms. (steps per millisecond=156 ) properties seen :8
Running SMT prover for 22 properties.
[2023-04-06 22:43:20] [INFO ] Flow matrix only has 272 transitions (discarded 335 similar events)
// Phase 1: matrix 272 rows 178 cols
[2023-04-06 22:43:20] [INFO ] Computed 16 invariants in 10 ms
[2023-04-06 22:43:20] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:43:20] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:43:20] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-04-06 22:43:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:43:20] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:43:21] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-04-06 22:43:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:43:21] [INFO ] After 312ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 288 ms
[2023-04-06 22:43:21] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 173 ms
[2023-04-06 22:43:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:43:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-06 22:43:22] [INFO ] After 1780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :22
Attempting to minimize the solution found.
Minimization took 327 ms.
[2023-04-06 22:43:23] [INFO ] After 2575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :22
Parikh walk visited 0 properties in 109 ms.
Support contains 34 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 607/607 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 177 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 177 transition count 602
Applied a total of 2 rules in 19 ms. Remains 177 /178 variables (removed 1) and now considering 602/607 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 177/178 places, 602/607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 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
Interrupted probabilistic random walk after 414288 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{8=1, 11=1}
Probabilistic random walk after 414288 steps, saw 87229 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :2
Running SMT prover for 19 properties.
[2023-04-06 22:43:26] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
// Phase 1: matrix 267 rows 177 cols
[2023-04-06 22:43:26] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:43:26] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:43:26] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:43:26] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 22:43:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:43:26] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:43:27] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 22:43:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:43:27] [INFO ] After 256ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 351 ms
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-04-06 22:43:28] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:43:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:43:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2023-04-06 22:43:28] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 22:43:28] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 22:43:28] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-06 22:43:28] [INFO ] After 1427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-04-06 22:43:28] [INFO ] After 2092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 69 ms.
Support contains 31 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 602/602 transitions.
Applied a total of 0 rules in 12 ms. Remains 177 /177 variables (removed 0) and now considering 602/602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 177/177 places, 602/602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) 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 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 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 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 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 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 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 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 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 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 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 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
Interrupted probabilistic random walk after 440946 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440946 steps, saw 91970 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-06 22:43:32] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 22:43:32] [INFO ] Invariant cache hit.
[2023-04-06 22:43:32] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:43:32] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:43:32] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 22:43:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:43:32] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:43:33] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 22:43:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:43:33] [INFO ] After 250ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 283 ms
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:43:33] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 22:43:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-06 22:43:34] [INFO ] After 1761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-04-06 22:43:35] [INFO ] After 2414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 98 ms.
Support contains 31 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 602/602 transitions.
Applied a total of 0 rules in 11 ms. Remains 177 /177 variables (removed 0) and now considering 602/602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 177/177 places, 602/602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 602/602 transitions.
Applied a total of 0 rules in 10 ms. Remains 177 /177 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2023-04-06 22:43:35] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 22:43:35] [INFO ] Invariant cache hit.
[2023-04-06 22:43:35] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-04-06 22:43:35] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 22:43:35] [INFO ] Invariant cache hit.
[2023-04-06 22:43:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:43:35] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-04-06 22:43:35] [INFO ] Redundant transitions in 32 ms returned []
[2023-04-06 22:43:35] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 22:43:35] [INFO ] Invariant cache hit.
[2023-04-06 22:43:35] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 601 ms. Remains : 177/177 places, 602/602 transitions.
Graph (trivial) has 383 edges and 177 vertex of which 24 / 177 are part of one of the 5 SCC in 4 ms
Free SCC test removed 19 places
Drop transitions removed 71 transitions
Ensure Unique test removed 321 transitions
Reduce isomorphic transitions removed 392 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 158 transition count 186
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 134 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 132 transition count 184
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 53 place count 132 transition count 174
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 77 place count 118 transition count 174
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 131 place count 91 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 91 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 148 place count 85 transition count 199
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 85 transition count 197
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 157 place count 85 transition count 190
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 167 place count 85 transition count 180
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 177 place count 75 transition count 180
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 190 place count 75 transition count 180
Applied a total of 190 rules in 35 ms. Remains 75 /177 variables (removed 102) and now considering 180/602 (removed 422) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 180 rows 75 cols
[2023-04-06 22:43:35] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 22:43:35] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:43:35] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 22:43:36] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 22:43:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:43:36] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:43:36] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 22:43:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 22:43:36] [INFO ] After 145ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 22:43:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 22:43:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 22:43:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-04-06 22:43:36] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-06 22:43:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 133 ms
[2023-04-06 22:43:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-04-06 22:43:36] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-04-06 22:43:36] [INFO ] After 910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2023-04-06 22:43:36] [INFO ] Flatten gal took : 30 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 32 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 770 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 289 transition count 765
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 284 transition count 765
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 284 transition count 686
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 205 transition count 686
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 182 place count 191 transition count 616
Iterating global reduction 2 with 14 rules applied. Total rules applied 196 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 236 place count 171 transition count 596
Applied a total of 236 rules in 46 ms. Remains 171 /289 variables (removed 118) and now considering 596/770 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 171/289 places, 596/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 19 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 19 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 596 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 276 transition count 705
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 276 transition count 705
Applied a total of 26 rules in 10 ms. Remains 276 /289 variables (removed 13) and now considering 705/770 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 276/289 places, 705/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 19 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 20 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 278 transition count 715
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 278 transition count 715
Applied a total of 22 rules in 8 ms. Remains 278 /289 variables (removed 11) and now considering 715/770 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 278/289 places, 715/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 19 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 20 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 715 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 276 transition count 705
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 276 transition count 705
Applied a total of 26 rules in 9 ms. Remains 276 /289 variables (removed 13) and now considering 705/770 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 276/289 places, 705/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 18 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 276 transition count 705
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 276 transition count 705
Applied a total of 26 rules in 7 ms. Remains 276 /289 variables (removed 13) and now considering 705/770 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 276/289 places, 705/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 18 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 276 transition count 705
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 276 transition count 705
Applied a total of 26 rules in 8 ms. Remains 276 /289 variables (removed 13) and now considering 705/770 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 276/289 places, 705/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 16 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 23 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 279 transition count 720
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 279 transition count 720
Applied a total of 20 rules in 9 ms. Remains 279 /289 variables (removed 10) and now considering 720/770 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 279/289 places, 720/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 16 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 720 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 275 transition count 700
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 275 transition count 700
Applied a total of 28 rules in 8 ms. Remains 275 /289 variables (removed 14) and now considering 700/770 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 275/289 places, 700/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 16 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 289 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 286 transition count 767
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 6 place count 286 transition count 691
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 158 place count 210 transition count 691
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 171 place count 197 transition count 626
Iterating global reduction 2 with 13 rules applied. Total rules applied 184 place count 197 transition count 626
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 224 place count 177 transition count 606
Applied a total of 224 rules in 37 ms. Remains 177 /289 variables (removed 112) and now considering 606/770 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 177/289 places, 606/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 18 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 606 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 275 transition count 700
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 275 transition count 700
Applied a total of 28 rules in 8 ms. Remains 275 /289 variables (removed 14) and now considering 700/770 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 275/289 places, 700/770 transitions.
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:43:37] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:37] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 289 transition count 765
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 284 transition count 765
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 284 transition count 685
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 204 transition count 685
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 184 place count 190 transition count 615
Iterating global reduction 2 with 14 rules applied. Total rules applied 198 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 238 place count 170 transition count 595
Applied a total of 238 rules in 31 ms. Remains 170 /289 variables (removed 119) and now considering 595/770 (removed 175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 170/289 places, 595/770 transitions.
[2023-04-06 22:43:38] [INFO ] Flatten gal took : 13 ms
[2023-04-06 22:43:38] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:43:38] [INFO ] Input system was already deterministic with 595 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 467974 steps, run visited all 1 properties in 1171 ms. (steps per millisecond=399 )
Probabilistic random walk after 467974 steps, saw 95762 distinct states, run finished after 1172 ms. (steps per millisecond=399 ) properties seen :1
FORMULA EisenbergMcGuire-PT-05-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 278 transition count 715
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 278 transition count 715
Applied a total of 22 rules in 6 ms. Remains 278 /289 variables (removed 11) and now considering 715/770 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 278/289 places, 715/770 transitions.
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 14 ms
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:43:39] [INFO ] Input system was already deterministic with 715 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 276 transition count 705
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 276 transition count 705
Applied a total of 26 rules in 6 ms. Remains 276 /289 variables (removed 13) and now considering 705/770 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 276/289 places, 705/770 transitions.
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 14 ms
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 30 ms
[2023-04-06 22:43:39] [INFO ] Input system was already deterministic with 705 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 289 transition count 766
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 285 transition count 765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 284 transition count 765
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 10 place count 284 transition count 686
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 168 place count 205 transition count 686
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 182 place count 191 transition count 616
Iterating global reduction 3 with 14 rules applied. Total rules applied 196 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 236 place count 171 transition count 596
Applied a total of 236 rules in 28 ms. Remains 171 /289 variables (removed 118) and now considering 596/770 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 171/289 places, 596/770 transitions.
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 19 ms
[2023-04-06 22:43:39] [INFO ] Input system was already deterministic with 596 transitions.
Finished random walk after 183 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=183 )
FORMULA EisenbergMcGuire-PT-05-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 275 transition count 700
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 275 transition count 700
Applied a total of 28 rules in 6 ms. Remains 275 /289 variables (removed 14) and now considering 700/770 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 275/289 places, 700/770 transitions.
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 14 ms
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:43:39] [INFO ] Input system was already deterministic with 700 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 770/770 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 277 transition count 710
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 277 transition count 710
Applied a total of 24 rules in 6 ms. Remains 277 /289 variables (removed 12) and now considering 710/770 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 277/289 places, 710/770 transitions.
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 14 ms
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:43:39] [INFO ] Input system was already deterministic with 710 transitions.
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:39] [INFO ] Flatten gal took : 17 ms
[2023-04-06 22:43:39] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-06 22:43:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 289 places, 770 transitions and 3480 arcs took 4 ms.
Total runtime 45414 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 289 NrTr: 770 NrArc: 3480)

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

net check time: 0m 0.000sec

init dd package: 0m 2.749sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8332676 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102236 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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.001sec

52499 116427 235978 273466 266746 249262 377516 465890 457973 545182 602579 624604 637681 723781 755148 861584 887836 882264 902776 914308 980126 1011308 1020215 1033953 1140812 1211504 1212430 1305662 1351277 1406908 1408480 1435954 1420758 1411546 1437877 1438319 1451781 1469255 1534738 1541988 1532403 1585597 1592643 1589945 1605270 1614093 1611776 1606882 1611411 1637974 1658026 1706088 1730663 1766388 1759642 1784612

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-05"
export BK_EXAMINATION="CTLFireability"
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-05, examination is CTLFireability"
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-167987247100234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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