About the Execution of LTSMin+red for GPPP-PT-C0010N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7526.703 | 98314.00 | 380057.00 | 353.40 | FTTFTTTFFTTFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856400818.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 GPPP-PT-C0010N0000000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856400818
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000010-CTLFireability-00
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-01
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-02
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-03
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-04
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-05
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-06
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-07
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-08
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-09
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-10
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-11
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-12
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-13
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-14
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678650399840
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=GPPP-PT-C0010N0000000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:46:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:46:41] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-12 19:46:41] [INFO ] Transformed 33 places.
[2023-03-12 19:46:41] [INFO ] Transformed 22 transitions.
[2023-03-12 19:46:41] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 19:46:41] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 19:46:41] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2023-03-12 19:46:41] [INFO ] Invariant cache hit.
[2023-03-12 19:46:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 19:46:41] [INFO ] Invariant cache hit.
[2023-03-12 19:46:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-12 19:46:41] [INFO ] Invariant cache hit.
[2023-03-12 19:46:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 19:46:42] [INFO ] Flatten gal took : 17 ms
[2023-03-12 19:46:42] [INFO ] Flatten gal took : 6 ms
[2023-03-12 19:46:42] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10001 steps, including 23 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 47) seen :42
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 19:46:42] [INFO ] Invariant cache hit.
[2023-03-12 19:46:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 19:46:42] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 19:46:42] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 19:46:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 19:46:42] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-12 19:46:43] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 20 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 5 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 3 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 3 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 3 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 8 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 3 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
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 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 24 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 19:46:43] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 24/33 places, 15/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 19:46:43] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:46:43] [INFO ] Invariant cache hit.
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 28 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
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 2 with 2 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 6 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 19:46:43] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 25/33 places, 16/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 19:46:43] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 19:46:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 1 ms
[2023-03-12 19:46:43] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Flatten gal took : 2 ms
[2023-03-12 19:46:43] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 19:46:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 0 ms.
Total runtime 2619 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/533/ctl_0_ --ctl=/tmp/533/ctl_1_ --ctl=/tmp/533/ctl_2_ --ctl=/tmp/533/ctl_3_ --ctl=/tmp/533/ctl_4_ --ctl=/tmp/533/ctl_5_ --ctl=/tmp/533/ctl_6_ --ctl=/tmp/533/ctl_7_ --ctl=/tmp/533/ctl_8_ --ctl=/tmp/533/ctl_9_ --ctl=/tmp/533/ctl_10_ --ctl=/tmp/533/ctl_11_ --ctl=/tmp/533/ctl_12_ --ctl=/tmp/533/ctl_13_ --ctl=/tmp/533/ctl_14_ --ctl=/tmp/533/ctl_15_ --mu-par --mu-opt
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678650498154
--------------------
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
mcc2023
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-00
ctl formula formula --ctl=/tmp/533/ctl_0_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-01
ctl formula formula --ctl=/tmp/533/ctl_1_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-02
ctl formula formula --ctl=/tmp/533/ctl_2_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-03
ctl formula formula --ctl=/tmp/533/ctl_3_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-04
ctl formula formula --ctl=/tmp/533/ctl_4_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-05
ctl formula formula --ctl=/tmp/533/ctl_5_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-06
ctl formula formula --ctl=/tmp/533/ctl_6_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-07
ctl formula formula --ctl=/tmp/533/ctl_7_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-08
ctl formula formula --ctl=/tmp/533/ctl_8_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-09
ctl formula formula --ctl=/tmp/533/ctl_9_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-10
ctl formula formula --ctl=/tmp/533/ctl_10_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-11
ctl formula formula --ctl=/tmp/533/ctl_11_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-12
ctl formula formula --ctl=/tmp/533/ctl_12_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-13
ctl formula formula --ctl=/tmp/533/ctl_13_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-14
ctl formula formula --ctl=/tmp/533/ctl_14_
ctl formula name GPPP-PT-C0010N0000000010-CTLFireability-15
ctl formula formula --ctl=/tmp/533/ctl_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 33 places, 22 transitions and 83 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 22->19 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 33; there are 19 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 48195 group checks and 0 next state calls
pnml2lts-sym: reachability took 2.480 real 9.480 user 0.420 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.050 user 0.010 sys
pnml2lts-sym: state space has 23537012497 states, 44242 nodes
pnml2lts-sym: Formula /tmp/533/ctl_2_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/533/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_15_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/533/ctl_0_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_14_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_4_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_5_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/533/ctl_8_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_9_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_13_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_7_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_12_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_10_ holds for the initial state
pnml2lts-sym: Formula /tmp/533/ctl_11_ does not hold for the initial state
pnml2lts-sym: group_next: 8832 nodes total
pnml2lts-sym: group_explored: 9070 nodes, 254233 short vectors total
pnml2lts-sym: max token count: 110
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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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 r169-tall-167838856400818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000010.tgz
mv GPPP-PT-C0010N0000000010 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 '
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 ;