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.r233-tall-167856419000522.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 ltsminxred
Input is LeafsetExtension-PT-S64C2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419000522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 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 LeafsetExtension-PT-S64C2-CTLFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679546042150

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 04:34:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 04:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 04:34:04] [INFO ] Load time of PNML (sax parser for PT used): 489 ms
[2023-03-23 04:34:04] [INFO ] Transformed 21462 places.
[2023-03-23 04:34:04] [INFO ] Transformed 21129 transitions.
[2023-03-23 04:34:04] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 635 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 185 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 296 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-23 04:34:06] [INFO ] Computed 198 place invariants in 1791 ms
[2023-03-23 04:34:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 04:34:08] [INFO ] Implicit Places using invariants in 3720 ms returned []
Implicit Place search using SMT only with invariants took 3743 ms to find 0 implicit places.
[2023-03-23 04:34:08] [INFO ] Invariant cache hit.
[2023-03-23 04:34:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 04:34:10] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/21462 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5531 ms. Remains : 17233/21462 places, 21129/21129 transitions.
Support contains 185 out of 17233 places after structural reductions.
[2023-03-23 04:34:11] [INFO ] Flatten gal took : 847 ms
[2023-03-23 04:34:11] [INFO ] Flatten gal took : 593 ms
[2023-03-23 04:34:13] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 10000 steps, including 549 resets, run finished after 801 ms. (steps per millisecond=12 ) properties (out of 93) seen :33
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 7 ms. (steps per millisecond=143 ) properties (out of 59) seen :1
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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 57) 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 57) 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 57) 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 57) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 56) 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 55) 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 55) 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 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 54) 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 54) 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 53) 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 53) 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 53) 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 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) 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 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 51) 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 51) 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 51) 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 50) 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 50) 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 50) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) 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 46) 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 46) 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 46) 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 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) 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 45) 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 45) seen :0
Running SMT prover for 45 properties.
[2023-03-23 04:34:14] [INFO ] Invariant cache hit.
[2023-03-23 04:34:26] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 385 ms returned sat
[2023-03-23 04:34:39] [INFO ] After 3567ms SMT Verify possible using state equation in real domain returned unsat :0 sat :30 real:14
[2023-03-23 04:34:39] [INFO ] After 3599ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :30 real:14
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-23 04:34:39] [INFO ] After 25055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :30 real:14
[2023-03-23 04:34:50] [INFO ] [Nat]Absence check using 0 positive and 198 generalized place invariants in 381 ms returned sat
[2023-03-23 04:35:04] [INFO ] After 5045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2023-03-23 04:35:04] [INFO ] After 5046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 04:35:04] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
Fused 45 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 88 out of 17233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 3327 are kept as prefixes of interest. Removing 13906 places using SCC suffix rule.32 ms
Discarding 13906 places :
Also discarding 10240 output transitions
Drop transitions removed 10240 transitions
Drop transitions removed 3572 transitions
Reduce isomorphic transitions removed 3572 transitions.
Drop transitions removed 1079 transitions
Trivial Post-agglo rules discarded 1079 transitions
Performed 1079 trivial Post agglomeration. Transition count delta: 1079
Iterating post reduction 0 with 4651 rules applied. Total rules applied 4652 place count 3327 transition count 6238
Reduce places removed 1081 places and 0 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 1101 rules applied. Total rules applied 5753 place count 2246 transition count 6218
Reduce places removed 20 places and 0 transitions.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Iterating post reduction 2 with 72 rules applied. Total rules applied 5825 place count 2226 transition count 6166
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 5877 place count 2174 transition count 6166
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 5877 place count 2174 transition count 6130
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 5949 place count 2138 transition count 6130
Discarding 610 places :
Symmetric choice reduction at 4 with 610 rule applications. Total rules 6559 place count 1528 transition count 5520
Iterating global reduction 4 with 610 rules applied. Total rules applied 7169 place count 1528 transition count 5520
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 7186 place count 1528 transition count 5503
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 7203 place count 1511 transition count 5503
Partial Free-agglomeration rule applied 471 times.
Drop transitions removed 471 transitions
Iterating global reduction 5 with 471 rules applied. Total rules applied 7674 place count 1511 transition count 5503
Applied a total of 7674 rules in 1155 ms. Remains 1511 /17233 variables (removed 15722) and now considering 5503/21129 (removed 15626) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1157 ms. Remains : 1511/17233 places, 5503/21129 transitions.
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 45) seen :31
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :1
Running SMT prover for 11 properties.
[2023-03-23 04:35:06] [INFO ] Flow matrix only has 2574 transitions (discarded 2929 similar events)
// Phase 1: matrix 2574 rows 1511 cols
[2023-03-23 04:35:06] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-23 04:35:06] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-23 04:35:08] [INFO ] After 1462ms SMT Verify possible using state equation in real domain returned unsat :1 sat :10
[2023-03-23 04:35:09] [INFO ] After 2948ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 817 ms.
[2023-03-23 04:35:10] [INFO ] After 4425ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 38 out of 1511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1511/1511 places, 5503/5503 transitions.
Graph (complete) has 6189 edges and 1511 vertex of which 676 are kept as prefixes of interest. Removing 835 places using SCC suffix rule.1 ms
Discarding 835 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Drop transitions removed 741 transitions
Reduce isomorphic transitions removed 741 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 743 rules applied. Total rules applied 744 place count 676 transition count 4690
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 746 place count 674 transition count 4690
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 783 place count 637 transition count 4653
Iterating global reduction 2 with 37 rules applied. Total rules applied 820 place count 637 transition count 4653
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 2 with 59 rules applied. Total rules applied 879 place count 637 transition count 4653
Applied a total of 879 rules in 176 ms. Remains 637 /1511 variables (removed 874) and now considering 4653/5503 (removed 850) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 637/1511 places, 4653/5503 transitions.
Incomplete random walk after 10000 steps, including 1233 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-23 04:35:11] [INFO ] Flow matrix only has 948 transitions (discarded 3705 similar events)
// Phase 1: matrix 948 rows 637 cols
[2023-03-23 04:35:11] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-23 04:35:11] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 04:35:11] [INFO ] After 398ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:4
[2023-03-23 04:35:12] [INFO ] After 699ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:4
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-23 04:35:12] [INFO ] After 1225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:4
[2023-03-23 04:35:12] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 04:35:13] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 04:35:13] [INFO ] After 1096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 343 ms.
[2023-03-23 04:35:14] [INFO ] After 1686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 10 ms.
Support contains 37 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 4653/4653 transitions.
Graph (complete) has 2466 edges and 637 vertex of which 603 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 603 transition count 4620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 602 transition count 4619
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 602 transition count 4619
Applied a total of 34 rules in 74 ms. Remains 602 /637 variables (removed 35) and now considering 4619/4653 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 602/637 places, 4619/4653 transitions.
Incomplete random walk after 10000 steps, including 1203 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 38360 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 38360 steps, saw 12824 distinct states, run finished after 3002 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-23 04:35:17] [INFO ] Flow matrix only has 882 transitions (discarded 3737 similar events)
// Phase 1: matrix 882 rows 602 cols
[2023-03-23 04:35:17] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-23 04:35:17] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 04:35:18] [INFO ] After 360ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:4
[2023-03-23 04:35:18] [INFO ] After 625ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:4
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-23 04:35:18] [INFO ] After 1033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:4
[2023-03-23 04:35:18] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-23 04:35:19] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 04:35:19] [INFO ] After 1020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-23 04:35:20] [INFO ] After 1559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 13 ms.
Support contains 37 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 4619/4619 transitions.
Applied a total of 0 rules in 45 ms. Remains 602 /602 variables (removed 0) and now considering 4619/4619 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 602/602 places, 4619/4619 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 4619/4619 transitions.
Applied a total of 0 rules in 47 ms. Remains 602 /602 variables (removed 0) and now considering 4619/4619 (removed 0) transitions.
[2023-03-23 04:35:20] [INFO ] Flow matrix only has 882 transitions (discarded 3737 similar events)
[2023-03-23 04:35:20] [INFO ] Invariant cache hit.
[2023-03-23 04:35:20] [INFO ] Implicit Places using invariants in 440 ms returned [321]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 445 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 601/602 places, 4619/4619 transitions.
Applied a total of 0 rules in 44 ms. Remains 601 /601 variables (removed 0) and now considering 4619/4619 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 536 ms. Remains : 601/602 places, 4619/4619 transitions.
Incomplete random walk after 10000 steps, including 1187 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 04:35:21] [INFO ] Flow matrix only has 882 transitions (discarded 3737 similar events)
// Phase 1: matrix 882 rows 601 cols
[2023-03-23 04:35:21] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-23 04:35:21] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 3 ms returned sat
[2023-03-23 04:35:21] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:4
[2023-03-23 04:35:22] [INFO ] After 530ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-23 04:35:22] [INFO ] After 871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:4
[2023-03-23 04:35:22] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 2 ms returned sat
[2023-03-23 04:35:22] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 04:35:23] [INFO ] After 926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-03-23 04:35:23] [INFO ] After 1416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 6 ms.
Support contains 34 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 4619/4619 transitions.
Graph (complete) has 2333 edges and 601 vertex of which 569 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 569 transition count 4588
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 567 transition count 4586
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 567 transition count 4586
Applied a total of 34 rules in 67 ms. Remains 567 /601 variables (removed 34) and now considering 4586/4619 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 567/601 places, 4586/4619 transitions.
Incomplete random walk after 10000 steps, including 1161 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2023-03-23 04:35:24] [INFO ] Flow matrix only has 818 transitions (discarded 3768 similar events)
// Phase 1: matrix 818 rows 567 cols
[2023-03-23 04:35:24] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-23 04:35:24] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 3 ms returned sat
[2023-03-23 04:35:24] [INFO ] After 300ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2023-03-23 04:35:24] [INFO ] After 503ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4 real:2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-23 04:35:24] [INFO ] After 777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:2
[2023-03-23 04:35:24] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 2 ms returned sat
[2023-03-23 04:35:25] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 04:35:25] [INFO ] After 666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-23 04:35:25] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 4 ms.
Support contains 24 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 4586/4586 transitions.
Graph (complete) has 2206 edges and 567 vertex of which 494 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 494 transition count 4515
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 493 transition count 4514
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 493 transition count 4514
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 493 transition count 4514
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 492 transition count 4514
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 492 transition count 4513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 491 transition count 4513
Applied a total of 72 rules in 156 ms. Remains 491 /567 variables (removed 76) and now considering 4513/4586 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 491/567 places, 4513/4586 transitions.
Incomplete random walk after 10000 steps, including 1251 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 04:35:26] [INFO ] Flow matrix only has 680 transitions (discarded 3833 similar events)
// Phase 1: matrix 680 rows 491 cols
[2023-03-23 04:35:26] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-23 04:35:26] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 04:35:26] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2023-03-23 04:35:26] [INFO ] After 348ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-23 04:35:26] [INFO ] After 560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:2
[2023-03-23 04:35:27] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 04:35:27] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 04:35:27] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-23 04:35:27] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4 ms.
Support contains 21 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 4513/4513 transitions.
Graph (complete) has 1759 edges and 491 vertex of which 455 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 455 transition count 4477
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 455 transition count 4477
Applied a total of 37 rules in 84 ms. Remains 455 /491 variables (removed 36) and now considering 4477/4513 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 455/491 places, 4477/4513 transitions.
Incomplete random walk after 10000 steps, including 1205 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 04:35:28] [INFO ] Flow matrix only has 610 transitions (discarded 3867 similar events)
// Phase 1: matrix 610 rows 455 cols
[2023-03-23 04:35:28] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 04:35:28] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 04:35:28] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-23 04:35:28] [INFO ] After 407ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-23 04:35:28] [INFO ] After 624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 18 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 4477/4477 transitions.
Graph (complete) has 1566 edges and 455 vertex of which 453 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 453 transition count 4475
Applied a total of 2 rules in 43 ms. Remains 453 /455 variables (removed 2) and now considering 4475/4477 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 453/455 places, 4475/4477 transitions.
Incomplete random walk after 10000 steps, including 1218 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 42286 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42286 steps, saw 13692 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-23 04:35:32] [INFO ] Flow matrix only has 607 transitions (discarded 3868 similar events)
// Phase 1: matrix 607 rows 453 cols
[2023-03-23 04:35:32] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-23 04:35:32] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-23 04:35:32] [INFO ] After 226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-23 04:35:32] [INFO ] After 390ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-23 04:35:32] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 4475/4475 transitions.
Applied a total of 0 rules in 39 ms. Remains 453 /453 variables (removed 0) and now considering 4475/4475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 453/453 places, 4475/4475 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 4475/4475 transitions.
Applied a total of 0 rules in 39 ms. Remains 453 /453 variables (removed 0) and now considering 4475/4475 (removed 0) transitions.
[2023-03-23 04:35:32] [INFO ] Flow matrix only has 607 transitions (discarded 3868 similar events)
[2023-03-23 04:35:32] [INFO ] Invariant cache hit.
[2023-03-23 04:35:33] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-23 04:35:33] [INFO ] Flow matrix only has 607 transitions (discarded 3868 similar events)
[2023-03-23 04:35:33] [INFO ] Invariant cache hit.
[2023-03-23 04:35:35] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned [4, 7, 10, 13, 18, 21, 24, 27, 30, 33, 72, 75, 114, 153, 156, 159, 162, 165, 203, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 268, 270, 273, 276, 279, 282, 285, 288, 291, 294, 297, 336, 339, 342, 345, 348, 351, 354, 357, 360, 364, 367, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 446, 449, 452]
Discarding 66 places :
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Implicit Place search using SMT with State Equation took 2269 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 387/453 places, 4445/4475 transitions.
Graph (complete) has 1011 edges and 387 vertex of which 357 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 357 transition count 4442
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 354 transition count 4442
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 186 place count 175 transition count 4263
Iterating global reduction 0 with 179 rules applied. Total rules applied 365 place count 175 transition count 4263
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 375 place count 170 transition count 4258
Free-agglomeration rule (complex) applied 62 times.
Iterating global reduction 0 with 62 rules applied. Total rules applied 437 place count 170 transition count 4196
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 499 place count 108 transition count 4196
Applied a total of 499 rules in 263 ms. Remains 108 /387 variables (removed 279) and now considering 4196/4445 (removed 249) transitions.
[2023-03-23 04:35:35] [INFO ] Flow matrix only has 297 transitions (discarded 3899 similar events)
// Phase 1: matrix 297 rows 108 cols
[2023-03-23 04:35:35] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 04:35:35] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-23 04:35:35] [INFO ] Flow matrix only has 297 transitions (discarded 3899 similar events)
[2023-03-23 04:35:35] [INFO ] Invariant cache hit.
[2023-03-23 04:35:36] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/453 places, 4196/4475 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3326 ms. Remains : 108/453 places, 4196/4475 transitions.
Incomplete random walk after 10000 steps, including 1752 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Finished probabilistic random walk after 78724 steps, run visited all 4 properties in 1444 ms. (steps per millisecond=54 )
Probabilistic random walk after 78724 steps, saw 23177 distinct states, run finished after 1445 ms. (steps per millisecond=54 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-23 04:35:38] [INFO ] Flatten gal took : 473 ms
[2023-03-23 04:35:38] [INFO ] Flatten gal took : 515 ms
[2023-03-23 04:35:39] [INFO ] Input system was already deterministic with 21129 transitions.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LeafsetExtension-PT-S64C2-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 94 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:40] [INFO ] Flatten gal took : 453 ms
[2023-03-23 04:35:40] [INFO ] Flatten gal took : 498 ms
[2023-03-23 04:35:41] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:42] [INFO ] Flatten gal took : 442 ms
[2023-03-23 04:35:42] [INFO ] Flatten gal took : 506 ms
[2023-03-23 04:35:43] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 66 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:44] [INFO ] Flatten gal took : 462 ms
[2023-03-23 04:35:44] [INFO ] Flatten gal took : 485 ms
[2023-03-23 04:35:45] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.47 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8092 transitions
Trivial Post-agglo rules discarded 8092 transitions
Performed 8092 trivial Post agglomeration. Transition count delta: 8092
Iterating post reduction 0 with 8092 rules applied. Total rules applied 8093 place count 17231 transition count 13035
Reduce places removed 8092 places and 0 transitions.
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 224
Iterating post reduction 1 with 8316 rules applied. Total rules applied 16409 place count 9139 transition count 12811
Reduce places removed 224 places and 0 transitions.
Iterating post reduction 2 with 224 rules applied. Total rules applied 16633 place count 8915 transition count 12811
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16633 place count 8915 transition count 12682
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16891 place count 8786 transition count 12682
Discarding 4027 places :
Symmetric choice reduction at 3 with 4027 rule applications. Total rules 20918 place count 4759 transition count 8655
Iterating global reduction 3 with 4027 rules applied. Total rules applied 24945 place count 4759 transition count 8655
Applied a total of 24945 rules in 2365 ms. Remains 4759 /17233 variables (removed 12474) and now considering 8655/21129 (removed 12474) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2367 ms. Remains : 4759/17233 places, 8655/21129 transitions.
[2023-03-23 04:35:48] [INFO ] Flatten gal took : 194 ms
[2023-03-23 04:35:48] [INFO ] Flatten gal took : 213 ms
[2023-03-23 04:35:49] [INFO ] Input system was already deterministic with 8655 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:49] [INFO ] Flatten gal took : 441 ms
[2023-03-23 04:35:50] [INFO ] Flatten gal took : 490 ms
[2023-03-23 04:35:51] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 78 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:51] [INFO ] Flatten gal took : 437 ms
[2023-03-23 04:35:52] [INFO ] Flatten gal took : 484 ms
[2023-03-23 04:35:52] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:53] [INFO ] Flatten gal took : 443 ms
[2023-03-23 04:35:54] [INFO ] Flatten gal took : 501 ms
[2023-03-23 04:35:54] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 60 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:35:55] [INFO ] Flatten gal took : 444 ms
[2023-03-23 04:35:55] [INFO ] Flatten gal took : 488 ms
[2023-03-23 04:35:56] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8286 transitions
Trivial Post-agglo rules discarded 8286 transitions
Performed 8286 trivial Post agglomeration. Transition count delta: 8286
Iterating post reduction 0 with 8286 rules applied. Total rules applied 8287 place count 17231 transition count 12841
Reduce places removed 8286 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16605 place count 8945 transition count 12809
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12680
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16895 place count 8784 transition count 12680
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20923 place count 4756 transition count 8652
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24951 place count 4756 transition count 8652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24951 place count 4756 transition count 8651
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24953 place count 4755 transition count 8651
Applied a total of 24953 rules in 2251 ms. Remains 4755 /17233 variables (removed 12478) and now considering 8651/21129 (removed 12478) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2251 ms. Remains : 4755/17233 places, 8651/21129 transitions.
[2023-03-23 04:35:59] [INFO ] Flatten gal took : 200 ms
[2023-03-23 04:35:59] [INFO ] Flatten gal took : 220 ms
[2023-03-23 04:35:59] [INFO ] Input system was already deterministic with 8651 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:36:00] [INFO ] Flatten gal took : 436 ms
[2023-03-23 04:36:01] [INFO ] Flatten gal took : 488 ms
[2023-03-23 04:36:01] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:36:02] [INFO ] Flatten gal took : 431 ms
[2023-03-23 04:36:02] [INFO ] Flatten gal took : 480 ms
[2023-03-23 04:36:03] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2329 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2329 ms. Remains : 4752/17233 places, 8648/21129 transitions.
[2023-03-23 04:36:06] [INFO ] Flatten gal took : 189 ms
[2023-03-23 04:36:06] [INFO ] Flatten gal took : 211 ms
[2023-03-23 04:36:06] [INFO ] Input system was already deterministic with 8648 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8189 transitions
Trivial Post-agglo rules discarded 8189 transitions
Performed 8189 trivial Post agglomeration. Transition count delta: 8189
Iterating post reduction 0 with 8189 rules applied. Total rules applied 8190 place count 17231 transition count 12938
Reduce places removed 8189 places and 0 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 1 with 8317 rules applied. Total rules applied 16507 place count 9042 transition count 12810
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 16635 place count 8914 transition count 12810
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16635 place count 8914 transition count 12681
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16893 place count 8785 transition count 12681
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20921 place count 4757 transition count 8653
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24949 place count 4757 transition count 8653
Applied a total of 24949 rules in 2253 ms. Remains 4757 /17233 variables (removed 12476) and now considering 8653/21129 (removed 12476) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2253 ms. Remains : 4757/17233 places, 8653/21129 transitions.
[2023-03-23 04:36:09] [INFO ] Flatten gal took : 189 ms
[2023-03-23 04:36:09] [INFO ] Flatten gal took : 214 ms
[2023-03-23 04:36:10] [INFO ] Input system was already deterministic with 8653 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 62 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:36:10] [INFO ] Flatten gal took : 439 ms
[2023-03-23 04:36:11] [INFO ] Flatten gal took : 492 ms
[2023-03-23 04:36:11] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 59 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 17233/17233 places, 21129/21129 transitions.
[2023-03-23 04:36:12] [INFO ] Flatten gal took : 480 ms
[2023-03-23 04:36:13] [INFO ] Flatten gal took : 464 ms
[2023-03-23 04:36:13] [INFO ] Input system was already deterministic with 21129 transitions.
[2023-03-23 04:36:14] [INFO ] Flatten gal took : 474 ms
[2023-03-23 04:36:15] [INFO ] Flatten gal took : 485 ms
[2023-03-23 04:36:15] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-23 04:36:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17233 places, 21129 transitions and 63509 arcs took 75 ms.
Total runtime 131464 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/558/ctl_0_ --ctl=/tmp/558/ctl_1_ --ctl=/tmp/558/ctl_2_ --ctl=/tmp/558/ctl_3_ --ctl=/tmp/558/ctl_4_ --ctl=/tmp/558/ctl_5_ --ctl=/tmp/558/ctl_6_ --ctl=/tmp/558/ctl_7_ --ctl=/tmp/558/ctl_8_ --ctl=/tmp/558/ctl_9_ --ctl=/tmp/558/ctl_10_ --ctl=/tmp/558/ctl_11_ --ctl=/tmp/558/ctl_12_ --ctl=/tmp/558/ctl_13_ --ctl=/tmp/558/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 158988 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16285856 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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LeafsetExtension-PT-S64C2, 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 r233-tall-167856419000522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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