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.r266-smll-167863541200617.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 Peterson-PT-4, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K Mar 5 18:23 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 Peterson-PT-4-CTLCardinality-00
FORMULA_NAME Peterson-PT-4-CTLCardinality-01
FORMULA_NAME Peterson-PT-4-CTLCardinality-02
FORMULA_NAME Peterson-PT-4-CTLCardinality-03
FORMULA_NAME Peterson-PT-4-CTLCardinality-04
FORMULA_NAME Peterson-PT-4-CTLCardinality-05
FORMULA_NAME Peterson-PT-4-CTLCardinality-06
FORMULA_NAME Peterson-PT-4-CTLCardinality-07
FORMULA_NAME Peterson-PT-4-CTLCardinality-08
FORMULA_NAME Peterson-PT-4-CTLCardinality-09
FORMULA_NAME Peterson-PT-4-CTLCardinality-10
FORMULA_NAME Peterson-PT-4-CTLCardinality-11
FORMULA_NAME Peterson-PT-4-CTLCardinality-12
FORMULA_NAME Peterson-PT-4-CTLCardinality-13
FORMULA_NAME Peterson-PT-4-CTLCardinality-14
FORMULA_NAME Peterson-PT-4-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679193903863

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 02:45:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 02:45:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:45:07] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-19 02:45:07] [INFO ] Transformed 480 places.
[2023-03-19 02:45:07] [INFO ] Transformed 690 transitions.
[2023-03-19 02:45:07] [INFO ] Found NUPN structural information;
[2023-03-19 02:45:07] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-19 02:45:07] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 75 ms.
FORMULA Peterson-PT-4-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 456 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 38 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-19 02:45:07] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-19 02:45:07] [INFO ] Computed 19 place invariants in 28 ms
[2023-03-19 02:45:08] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-19 02:45:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-19 02:45:08] [INFO ] Invariant cache hit.
[2023-03-19 02:45:09] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 02:45:09] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2023-03-19 02:45:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-19 02:45:09] [INFO ] Invariant cache hit.
[2023-03-19 02:45:10] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2614 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 456 out of 480 places after structural reductions.
[2023-03-19 02:45:10] [INFO ] Flatten gal took : 94 ms
[2023-03-19 02:45:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 02:45:10] [INFO ] Flatten gal took : 49 ms
[2023-03-19 02:45:10] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 454 out of 480 places (down from 456) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=9 ) properties (out of 53) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) 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 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-19 02:45:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-19 02:45:12] [INFO ] Invariant cache hit.
[2023-03-19 02:45:13] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-19 02:45:13] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 02:45:13] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :13 sat :0 real:18
[2023-03-19 02:45:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-19 02:45:13] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 02:45:14] [INFO ] After 820ms SMT Verify possible using state equation in natural domain returned unsat :19 sat :12
[2023-03-19 02:45:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 02:45:15] [INFO ] After 477ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :19 sat :12
[2023-03-19 02:45:15] [INFO ] Deduced a trap composed of 17 places in 473 ms of which 8 ms to minimize.
[2023-03-19 02:45:16] [INFO ] Deduced a trap composed of 10 places in 434 ms of which 2 ms to minimize.
[2023-03-19 02:45:16] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 2 ms to minimize.
[2023-03-19 02:45:16] [INFO ] Deduced a trap composed of 62 places in 362 ms of which 3 ms to minimize.
[2023-03-19 02:45:17] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-19 02:45:17] [INFO ] Deduced a trap composed of 18 places in 425 ms of which 3 ms to minimize.
[2023-03-19 02:45:18] [INFO ] Deduced a trap composed of 48 places in 400 ms of which 1 ms to minimize.
[2023-03-19 02:45:18] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 2 ms to minimize.
[2023-03-19 02:45:18] [INFO ] Deduced a trap composed of 57 places in 291 ms of which 1 ms to minimize.
[2023-03-19 02:45:19] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 0 ms to minimize.
[2023-03-19 02:45:19] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 1 ms to minimize.
[2023-03-19 02:45:19] [INFO ] Deduced a trap composed of 58 places in 196 ms of which 1 ms to minimize.
[2023-03-19 02:45:19] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 0 ms to minimize.
[2023-03-19 02:45:20] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 1 ms to minimize.
[2023-03-19 02:45:20] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 1 ms to minimize.
[2023-03-19 02:45:20] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 2 ms to minimize.
[2023-03-19 02:45:21] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 1 ms to minimize.
[2023-03-19 02:45:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5989 ms
[2023-03-19 02:45:21] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 0 ms to minimize.
[2023-03-19 02:45:21] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 1 ms to minimize.
[2023-03-19 02:45:21] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 1 ms to minimize.
[2023-03-19 02:45:22] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 1 ms to minimize.
[2023-03-19 02:45:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 983 ms
[2023-03-19 02:45:22] [INFO ] Deduced a trap composed of 91 places in 284 ms of which 1 ms to minimize.
[2023-03-19 02:45:22] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 1 ms to minimize.
[2023-03-19 02:45:23] [INFO ] Deduced a trap composed of 78 places in 261 ms of which 1 ms to minimize.
[2023-03-19 02:45:23] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 1 ms to minimize.
[2023-03-19 02:45:23] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 1 ms to minimize.
[2023-03-19 02:45:24] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 1 ms to minimize.
[2023-03-19 02:45:24] [INFO ] Deduced a trap composed of 122 places in 239 ms of which 1 ms to minimize.
[2023-03-19 02:45:24] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 1 ms to minimize.
[2023-03-19 02:45:24] [INFO ] Deduced a trap composed of 122 places in 190 ms of which 1 ms to minimize.
[2023-03-19 02:45:25] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 1 ms to minimize.
[2023-03-19 02:45:25] [INFO ] Deduced a trap composed of 85 places in 351 ms of which 3 ms to minimize.
[2023-03-19 02:45:25] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 1 ms to minimize.
[2023-03-19 02:45:26] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 1 ms to minimize.
[2023-03-19 02:45:26] [INFO ] Deduced a trap composed of 91 places in 280 ms of which 2 ms to minimize.
[2023-03-19 02:45:26] [INFO ] Deduced a trap composed of 108 places in 232 ms of which 2 ms to minimize.
[2023-03-19 02:45:27] [INFO ] Deduced a trap composed of 82 places in 283 ms of which 1 ms to minimize.
[2023-03-19 02:45:27] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 1 ms to minimize.
[2023-03-19 02:45:27] [INFO ] Deduced a trap composed of 87 places in 220 ms of which 1 ms to minimize.
[2023-03-19 02:45:28] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 10 ms to minimize.
[2023-03-19 02:45:28] [INFO ] Deduced a trap composed of 88 places in 251 ms of which 1 ms to minimize.
[2023-03-19 02:45:28] [INFO ] Deduced a trap composed of 87 places in 233 ms of which 2 ms to minimize.
[2023-03-19 02:45:28] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6407 ms
[2023-03-19 02:45:29] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 1 ms to minimize.
[2023-03-19 02:45:29] [INFO ] Deduced a trap composed of 61 places in 301 ms of which 1 ms to minimize.
[2023-03-19 02:45:29] [INFO ] Deduced a trap composed of 84 places in 299 ms of which 1 ms to minimize.
[2023-03-19 02:45:30] [INFO ] Deduced a trap composed of 84 places in 287 ms of which 1 ms to minimize.
[2023-03-19 02:45:30] [INFO ] Deduced a trap composed of 61 places in 310 ms of which 1 ms to minimize.
[2023-03-19 02:45:30] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 1 ms to minimize.
[2023-03-19 02:45:31] [INFO ] Deduced a trap composed of 97 places in 340 ms of which 1 ms to minimize.
[2023-03-19 02:45:31] [INFO ] Deduced a trap composed of 62 places in 307 ms of which 1 ms to minimize.
[2023-03-19 02:45:31] [INFO ] Deduced a trap composed of 83 places in 247 ms of which 2 ms to minimize.
[2023-03-19 02:45:32] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 1 ms to minimize.
[2023-03-19 02:45:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3349 ms
[2023-03-19 02:45:32] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 1 ms to minimize.
[2023-03-19 02:45:32] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 0 ms to minimize.
[2023-03-19 02:45:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 622 ms
[2023-03-19 02:45:33] [INFO ] Deduced a trap composed of 96 places in 209 ms of which 1 ms to minimize.
[2023-03-19 02:45:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-19 02:45:33] [INFO ] After 19220ms SMT Verify possible using trap constraints in natural domain returned unsat :19 sat :12
Attempting to minimize the solution found.
Minimization took 1156 ms.
[2023-03-19 02:45:35] [INFO ] After 21756ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :12
Fused 31 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 22 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 480 transition count 516
Reduce places removed 174 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 180 rules applied. Total rules applied 354 place count 306 transition count 510
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 360 place count 300 transition count 510
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 360 place count 300 transition count 415
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 550 place count 205 transition count 415
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 586 place count 187 transition count 397
Applied a total of 586 rules in 109 ms. Remains 187 /480 variables (removed 293) and now considering 397/690 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 187/480 places, 397/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 483048 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{7=1}
Probabilistic random walk after 483048 steps, saw 80978 distinct states, run finished after 3003 ms. (steps per millisecond=160 ) properties seen :1
Running SMT prover for 10 properties.
[2023-03-19 02:45:39] [INFO ] Flow matrix only has 337 transitions (discarded 60 similar events)
// Phase 1: matrix 337 rows 187 cols
[2023-03-19 02:45:39] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 02:45:39] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-19 02:45:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 02:45:39] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 02:45:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-19 02:45:39] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-19 02:45:39] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 02:45:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 02:45:40] [INFO ] After 177ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 02:45:40] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2023-03-19 02:45:40] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-19 02:45:40] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-19 02:45:40] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-03-19 02:45:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2023-03-19 02:45:40] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2023-03-19 02:45:40] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 4 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 707 ms
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 5 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-19 02:45:41] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 952 ms
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-19 02:45:42] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-19 02:45:43] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1907 ms
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2023-03-19 02:45:44] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 543 ms
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 1 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 576 ms
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2023-03-19 02:45:45] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-19 02:45:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1101 ms
[2023-03-19 02:45:46] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-19 02:45:47] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2023-03-19 02:45:47] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-19 02:45:47] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-19 02:45:47] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2023-03-19 02:45:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 746 ms
[2023-03-19 02:45:47] [INFO ] After 7699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-19 02:45:48] [INFO ] After 8583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 134 ms.
Support contains 16 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 397/397 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 187 transition count 395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 185 transition count 395
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 185 transition count 390
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 180 transition count 390
Applied a total of 14 rules in 47 ms. Remains 180 /187 variables (removed 7) and now considering 390/397 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 180/187 places, 390/397 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 477540 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477540 steps, saw 79993 distinct states, run finished after 3002 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-19 02:45:52] [INFO ] Flow matrix only has 330 transitions (discarded 60 similar events)
// Phase 1: matrix 330 rows 180 cols
[2023-03-19 02:45:52] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 02:45:52] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-19 02:45:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-19 02:45:52] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 02:45:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-19 02:45:52] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-19 02:45:53] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 02:45:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 02:45:53] [INFO ] After 188ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 02:45:53] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-19 02:45:53] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2023-03-19 02:45:53] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2023-03-19 02:45:53] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-19 02:45:53] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2023-03-19 02:45:54] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2023-03-19 02:45:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 710 ms
[2023-03-19 02:45:54] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 0 ms to minimize.
[2023-03-19 02:45:54] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-19 02:45:54] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-19 02:45:54] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-19 02:45:54] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 0 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 1 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 1 ms to minimize.
[2023-03-19 02:45:55] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2384 ms
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 3 ms to minimize.
[2023-03-19 02:45:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-19 02:45:56] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 1 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-03-19 02:45:57] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1717 ms
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2023-03-19 02:45:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 0 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-19 02:45:59] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2023-03-19 02:46:00] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-19 02:46:00] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2023-03-19 02:46:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1086 ms
[2023-03-19 02:46:00] [INFO ] After 7068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-19 02:46:00] [INFO ] After 7685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 116 ms.
Support contains 16 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 390/390 transitions.
Applied a total of 0 rules in 24 ms. Remains 180 /180 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 180/180 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 390/390 transitions.
Applied a total of 0 rules in 23 ms. Remains 180 /180 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2023-03-19 02:46:00] [INFO ] Flow matrix only has 330 transitions (discarded 60 similar events)
[2023-03-19 02:46:00] [INFO ] Invariant cache hit.
[2023-03-19 02:46:00] [INFO ] Implicit Places using invariants in 292 ms returned [170, 171, 172, 173, 174]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 297 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 175/180 places, 390/390 transitions.
Applied a total of 0 rules in 22 ms. Remains 175 /175 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 344 ms. Remains : 175/180 places, 390/390 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 476814 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 476814 steps, saw 79881 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-19 02:46:04] [INFO ] Flow matrix only has 330 transitions (discarded 60 similar events)
// Phase 1: matrix 330 rows 175 cols
[2023-03-19 02:46:04] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-19 02:46:04] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-19 02:46:05] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 02:46:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-19 02:46:05] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 02:46:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 02:46:05] [INFO ] After 251ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 0 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-03-19 02:46:06] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1117 ms
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 1 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-19 02:46:07] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1441 ms
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2023-03-19 02:46:08] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2023-03-19 02:46:09] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1942 ms
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2023-03-19 02:46:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2023-03-19 02:46:11] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 0 ms to minimize.
[2023-03-19 02:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-19 02:46:11] [INFO ] After 5439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-19 02:46:11] [INFO ] After 6224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 140 ms.
Support contains 16 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 390/390 transitions.
Applied a total of 0 rules in 22 ms. Remains 175 /175 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 175/175 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 390/390 transitions.
Applied a total of 0 rules in 17 ms. Remains 175 /175 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2023-03-19 02:46:11] [INFO ] Flow matrix only has 330 transitions (discarded 60 similar events)
[2023-03-19 02:46:11] [INFO ] Invariant cache hit.
[2023-03-19 02:46:11] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-19 02:46:11] [INFO ] Flow matrix only has 330 transitions (discarded 60 similar events)
[2023-03-19 02:46:11] [INFO ] Invariant cache hit.
[2023-03-19 02:46:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-19 02:46:12] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
[2023-03-19 02:46:12] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-19 02:46:12] [INFO ] Flow matrix only has 330 transitions (discarded 60 similar events)
[2023-03-19 02:46:12] [INFO ] Invariant cache hit.
[2023-03-19 02:46:13] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1596 ms. Remains : 175/175 places, 390/390 transitions.
Graph (trivial) has 262 edges and 175 vertex of which 80 / 175 are part of one of the 18 SCC in 5 ms
Free SCC test removed 62 places
Drop transitions removed 124 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 195 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 113 transition count 184
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 102 transition count 184
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 91 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 46 place count 91 transition count 166
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 67 place count 79 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 34 edges and 79 vertex of which 10 / 79 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 73 place count 71 transition count 182
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 84 place count 70 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 69 transition count 171
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 101 place count 69 transition count 156
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 69 transition count 155
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 68 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 67 transition count 154
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 108 place count 67 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 111 place count 64 transition count 151
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 119 place count 64 transition count 151
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 120 place count 64 transition count 150
Applied a total of 120 rules in 78 ms. Remains 64 /175 variables (removed 111) and now considering 150/390 (removed 240) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 150 rows 64 cols
[2023-03-19 02:46:13] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 02:46:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-19 02:46:13] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 02:46:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-19 02:46:13] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 02:46:13] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-19 02:46:13] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Successfully simplified 19 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 02:46:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 65 ms
[2023-03-19 02:46:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-PT-4-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 58 ms
[2023-03-19 02:46:14] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 168 out of 480 places (down from 185) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 50 ms
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 53 ms
[2023-03-19 02:46:14] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 41 ms
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 41 ms
[2023-03-19 02:46:14] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 38 ms
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 39 ms
[2023-03-19 02:46:14] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 18 ms
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 20 ms
[2023-03-19 02:46:14] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 190 place count 480 transition count 500
Reduce places removed 190 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 195 rules applied. Total rules applied 385 place count 290 transition count 495
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 390 place count 285 transition count 495
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 390 place count 285 transition count 399
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 582 place count 189 transition count 399
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 3 with 40 rules applied. Total rules applied 622 place count 169 transition count 379
Applied a total of 622 rules in 33 ms. Remains 169 /480 variables (removed 311) and now considering 379/690 (removed 311) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 169/480 places, 379/690 transitions.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 11 ms
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 12 ms
[2023-03-19 02:46:14] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 17 ms
[2023-03-19 02:46:14] [INFO ] Flatten gal took : 18 ms
[2023-03-19 02:46:15] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 17 ms
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 17 ms
[2023-03-19 02:46:15] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 16 ms
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 18 ms
[2023-03-19 02:46:15] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 16 ms
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 17 ms
[2023-03-19 02:46:15] [INFO ] Input system was already deterministic with 690 transitions.
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 17 ms
[2023-03-19 02:46:15] [INFO ] Flatten gal took : 18 ms
[2023-03-19 02:46:15] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-19 02:46:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 5 ms.
Total runtime 68278 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 480 NrTr: 690 NrArc: 2120)

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

net check time: 0m 0.000sec

init dd package: 0m 3.499sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9443084 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095536 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

156295 335157 550689 661254 783101 967926 1000835 1109474 1079948 1045305

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="Peterson-PT-4"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Peterson-PT-4, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863541200617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;