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.r394-oct2-167903717700306.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPt-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 5.9K Feb 25 17:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679502615182

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:30:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:30:18] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-22 16:30:18] [INFO ] Transformed 763 places.
[2023-03-22 16:30:18] [INFO ] Transformed 563 transitions.
[2023-03-22 16:30:18] [INFO ] Found NUPN structural information;
[2023-03-22 16:30:18] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-040A-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 172 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 80 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2023-03-22 16:30:18] [INFO ] Computed 361 place invariants in 30 ms
[2023-03-22 16:30:20] [INFO ] Implicit Places using invariants in 1756 ms returned []
[2023-03-22 16:30:20] [INFO ] Invariant cache hit.
[2023-03-22 16:30:22] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 3527 ms to find 0 implicit places.
[2023-03-22 16:30:22] [INFO ] Invariant cache hit.
[2023-03-22 16:30:22] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4228 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 172 out of 763 places after structural reductions.
[2023-03-22 16:30:23] [INFO ] Flatten gal took : 181 ms
[2023-03-22 16:30:23] [INFO ] Flatten gal took : 64 ms
[2023-03-22 16:30:23] [INFO ] Input system was already deterministic with 562 transitions.
Support contains 163 out of 763 places (down from 172) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=15 ) properties (out of 72) seen :22
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-22 16:30:24] [INFO ] Invariant cache hit.
[2023-03-22 16:30:26] [INFO ] [Real]Absence check using 361 positive place invariants in 81 ms returned sat
[2023-03-22 16:30:29] [INFO ] After 4834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:50
[2023-03-22 16:30:31] [INFO ] [Nat]Absence check using 361 positive place invariants in 127 ms returned sat
[2023-03-22 16:30:37] [INFO ] After 4809ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :50
[2023-03-22 16:30:42] [INFO ] After 10580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :50
Attempting to minimize the solution found.
Minimization took 3905 ms.
[2023-03-22 16:30:46] [INFO ] After 17005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :50
Fused 50 Parikh solutions to 49 different solutions.
Parikh walk visited 0 properties in 5989 ms.
Support contains 124 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 61 times.
Drop transitions removed 61 transitions
Iterating global reduction 0 with 61 rules applied. Total rules applied 65 place count 761 transition count 560
Applied a total of 65 rules in 121 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 761/763 places, 560/562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 50) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 36) seen :0
Running SMT prover for 36 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-22 16:30:53] [INFO ] Computed 361 place invariants in 3 ms
[2023-03-22 16:30:54] [INFO ] [Real]Absence check using 361 positive place invariants in 163 ms returned sat
[2023-03-22 16:30:56] [INFO ] After 2422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:36
[2023-03-22 16:30:57] [INFO ] [Nat]Absence check using 361 positive place invariants in 115 ms returned sat
[2023-03-22 16:31:00] [INFO ] After 2247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :36
[2023-03-22 16:31:00] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 16:31:02] [INFO ] After 2184ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :36
[2023-03-22 16:31:05] [INFO ] After 5558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :36
Attempting to minimize the solution found.
Minimization took 2412 ms.
[2023-03-22 16:31:08] [INFO ] After 12040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :36
Parikh walk visited 13 properties in 5943 ms.
Support contains 58 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 761 transition count 560
Applied a total of 8 rules in 67 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 153716 steps, run timeout after 3002 ms. (steps per millisecond=51 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1}
Probabilistic random walk after 153716 steps, saw 150260 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-22 16:31:17] [INFO ] Computed 361 place invariants in 17 ms
[2023-03-22 16:31:18] [INFO ] [Real]Absence check using 361 positive place invariants in 236 ms returned sat
[2023-03-22 16:31:19] [INFO ] After 1139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:31:19] [INFO ] [Nat]Absence check using 361 positive place invariants in 84 ms returned sat
[2023-03-22 16:31:19] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 16:31:19] [INFO ] After 130ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:19] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-22 16:31:20] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 60 ms.
Support contains 9 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 761 transition count 560
Applied a total of 10 rules in 69 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 761/761 places, 560/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292891 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292891 steps, saw 283555 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 560 rows 761 cols
[2023-03-22 16:31:23] [INFO ] Computed 361 place invariants in 8 ms
[2023-03-22 16:31:23] [INFO ] [Real]Absence check using 361 positive place invariants in 127 ms returned sat
[2023-03-22 16:31:24] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:31:24] [INFO ] [Nat]Absence check using 361 positive place invariants in 200 ms returned sat
[2023-03-22 16:31:24] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 16:31:25] [INFO ] After 140ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:25] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-22 16:31:25] [INFO ] After 1275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 9 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 47 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 761/761 places, 560/560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 560/560 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-22 16:31:25] [INFO ] Invariant cache hit.
[2023-03-22 16:31:26] [INFO ] Implicit Places using invariants in 607 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 620 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 759/761 places, 560/560 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 47 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2023-03-22 16:31:26] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-22 16:31:26] [INFO ] Implicit Places using invariants in 582 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 757/761 places, 559/560 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 756 transition count 558
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 53 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2023-03-22 16:31:26] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-22 16:31:27] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-22 16:31:27] [INFO ] Invariant cache hit.
[2023-03-22 16:31:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-22 16:31:28] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 756/761 places, 558/560 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3231 ms. Remains : 756/761 places, 558/560 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 283737 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283737 steps, saw 274724 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 16:31:31] [INFO ] Invariant cache hit.
[2023-03-22 16:31:32] [INFO ] [Real]Absence check using 358 positive place invariants in 86 ms returned sat
[2023-03-22 16:31:32] [INFO ] After 1116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:31:33] [INFO ] [Nat]Absence check using 358 positive place invariants in 87 ms returned sat
[2023-03-22 16:31:33] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-22 16:31:33] [INFO ] After 122ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:33] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-22 16:31:33] [INFO ] After 1064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 57 ms.
Support contains 9 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 21 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 756/756 places, 558/558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 17 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2023-03-22 16:31:34] [INFO ] Invariant cache hit.
[2023-03-22 16:31:34] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-22 16:31:34] [INFO ] Invariant cache hit.
[2023-03-22 16:31:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-22 16:31:35] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
[2023-03-22 16:31:36] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-22 16:31:36] [INFO ] Invariant cache hit.
[2023-03-22 16:31:36] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2530 ms. Remains : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 756 transition count 558
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 756 transition count 519
Applied a total of 78 rules in 56 ms. Remains 756 /756 variables (removed 0) and now considering 519/558 (removed 39) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 519 rows 756 cols
[2023-03-22 16:31:36] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-22 16:31:36] [INFO ] [Real]Absence check using 358 positive place invariants in 76 ms returned sat
[2023-03-22 16:31:37] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:31:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 90 ms returned sat
[2023-03-22 16:31:37] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:38] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-22 16:31:38] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 61 ms
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 43 ms
[2023-03-22 16:31:38] [INFO ] Input system was already deterministic with 562 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 51 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 35 ms
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 35 ms
[2023-03-22 16:31:38] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 33 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 30 ms
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 32 ms
[2023-03-22 16:31:38] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 30 ms
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 31 ms
[2023-03-22 16:31:38] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:31:38] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:31:38] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 30 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 29 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 43 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 763 transition count 561
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 41 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 761/763 places, 560/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 38 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 560 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 37 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 19 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 39 ms
[2023-03-22 16:31:39] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:39] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:31:40] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 24 ms
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:40] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:31:40] [INFO ] Input system was already deterministic with 562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 9 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 763/763 places, 562/562 transitions.
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 26 ms
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 27 ms
[2023-03-22 16:31:40] [INFO ] Input system was already deterministic with 562 transitions.
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:40] [INFO ] Flatten gal took : 25 ms
[2023-03-22 16:31:40] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 16:31:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 763 places, 562 transitions and 2404 arcs took 5 ms.
Total runtime 82367 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 763 NrTr: 562 NrArc: 2404)

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

net check time: 0m 0.000sec

init dd package: 0m 3.289sec


before gc: list nodes free: 1877339

after gc: idd nodes used:1887, unused:63998113; list nodes free:285199994

before gc: list nodes free: 1563835

after gc: idd nodes used:2041, unused:63997959; list nodes free:285198960

before gc: list nodes free: 1258162

after gc: idd nodes used:2189, unused:63997811; list nodes free:285198191

before gc: list nodes free: 1101579

after gc: idd nodes used:2102, unused:63997898; list nodes free:285198284

before gc: list nodes free: 1059944

after gc: idd nodes used:2296, unused:63997704; list nodes free:285197268

before gc: list nodes free: 953787

after gc: idd nodes used:2413, unused:63997587; list nodes free:285196432

before gc: list nodes free: 1412189

after gc: idd nodes used:3432, unused:63996568; list nodes free:287287995

before gc: list nodes free: 839114

after gc: idd nodes used:6396, unused:63993604; list nodes free:289370113

before gc: list nodes free: 552702

after gc: idd nodes used:8367, unused:63991633; list nodes free:291458928

before gc: list nodes free: 698234

after gc: idd nodes used:7296, unused:63992704; list nodes free:291463331

before gc: list nodes free: 194317

after gc: idd nodes used:18352, unused:63981648; list nodes free:295602652

before gc: list nodes free: 311069

after gc: idd nodes used:27029, unused:63972971; list nodes free:299758520

before gc: list nodes free: 2455114

after gc: idd nodes used:27131, unused:63972869; list nodes free:299758799

before gc: list nodes free: 1397061

after gc: idd nodes used:26461, unused:63973539; list nodes free:299761956

before gc: list nodes free: 2627213

after gc: idd nodes used:27058, unused:63972942; list nodes free:299758412

before gc: list nodes free: 3701287

after gc: idd nodes used:26609, unused:63973391; list nodes free:299761916

before gc: list nodes free: 3594706

after gc: idd nodes used:22007, unused:63977993; list nodes free:299783700

before gc: list nodes free: 4089961

after gc: idd nodes used:23975, unused:63976025; list nodes free:299771061

before gc: list nodes free: 667335

after gc: idd nodes used:22972, unused:63977028; list nodes free:299775297

before gc: list nodes free: 2991694

after gc: idd nodes used:23990, unused:63976010; list nodes free:299770138

before gc: list nodes free: 680770

after gc: idd nodes used:24017, unused:63975983; list nodes free:299770649

before gc: list nodes free: 2794183

after gc: idd nodes used:21643, unused:63978357; list nodes free:299783795

before gc: list nodes free: 1884593

after gc: idd nodes used:70282, unused:63929718; list nodes free:303736310

before gc: list nodes free: 618755

after gc: idd nodes used:62140, unused:63937860; list nodes free:305879146

before gc: list nodes free: 1240020

after gc: idd nodes used:60882, unused:63939118; list nodes free:305889032

before gc: list nodes free: 3220407

after gc: idd nodes used:58490, unused:63941510; list nodes free:305904692

before gc: list nodes free: 4320103

after gc: idd nodes used:100989, unused:63899011; list nodes free:305695385

before gc: list nodes free: 951787

after gc: idd nodes used:96381, unused:63903619; list nodes free:305725574

before gc: list nodes free: 3746825

after gc: idd nodes used:100873, unused:63899127; list nodes free:305699400

before gc: list nodes free: 2532816

after gc: idd nodes used:94970, unused:63905030; list nodes free:305735357

before gc: list nodes free: 3989922

after gc: idd nodes used:95133, unused:63904867; list nodes free:305733826
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5930536 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098340 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.001sec

1794 1872 1895 1815 2099 1916 2082 1990 2036 1977 2170 1984 2181 2128 2216 2097 2241 2186 2271 2284 2240 2332 2290 2367 2326 2425 2372 2397 2410 2341 2415 2521 2509 1957 2441 2803 2895 2714 2794 4043 4083 4269 4145 3817 3708 3784 3692 3781 6120 5870 8579 8856 8588 8316 8979 8358 8524 7453 7337 7232 7307 7490 7105 7810 7284 7776 7054 7113 7339 19324 16745 16495 27813 25952 25983 26822 27152 26858 26323 25645 25864 26054 26226 27092 25920 26551 25655 27164 26088 22487 21127 21202 21562 21628 21027 21075 21168 21211 21697 21088 20834 21288 21990 21154 22327 21767 22903 21222 21046 21971 21067 21699 21477 21473 21964 61049 60864 58054 58420 58422 57762 97157 97006 94832 96301 96163 94722 96040 103999

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPt-PT-040A, 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 r394-oct2-167903717700306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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