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.r393-oct2-167903717000426.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 ltsminxred
Input is ShieldPPPs-PT-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717000426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 01:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 86K 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 ShieldPPPs-PT-005B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-005B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679447231113

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=ShieldPPPs-PT-005B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:07:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:07:13] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-22 01:07:13] [INFO ] Transformed 343 places.
[2023-03-22 01:07:13] [INFO ] Transformed 318 transitions.
[2023-03-22 01:07:13] [INFO ] Found NUPN structural information;
[2023-03-22 01:07:13] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 114 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 329 transition count 304
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 329 transition count 304
Applied a total of 28 rules in 59 ms. Remains 329 /343 variables (removed 14) and now considering 304/318 (removed 14) transitions.
// Phase 1: matrix 304 rows 329 cols
[2023-03-22 01:07:13] [INFO ] Computed 56 place invariants in 8 ms
[2023-03-22 01:07:14] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-22 01:07:14] [INFO ] Invariant cache hit.
[2023-03-22 01:07:14] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2023-03-22 01:07:14] [INFO ] Invariant cache hit.
[2023-03-22 01:07:15] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 329/343 places, 304/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1671 ms. Remains : 329/343 places, 304/318 transitions.
Support contains 114 out of 329 places after structural reductions.
[2023-03-22 01:07:15] [INFO ] Flatten gal took : 111 ms
[2023-03-22 01:07:15] [INFO ] Flatten gal took : 29 ms
[2023-03-22 01:07:15] [INFO ] Input system was already deterministic with 304 transitions.
Support contains 112 out of 329 places (down from 114) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 80) seen :73
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 01:07:16] [INFO ] Invariant cache hit.
[2023-03-22 01:07:16] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 01:07:16] [INFO ] [Nat]Absence check using 56 positive place invariants in 44 ms returned sat
[2023-03-22 01:07:16] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 7 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 1 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 5 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-22 01:07:17] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 14 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1521 ms
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:07:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2023-03-22 01:07:19] [INFO ] After 2235ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-22 01:07:19] [INFO ] After 2537ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 10 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 304/304 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 329 transition count 270
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 295 transition count 270
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 68 place count 295 transition count 244
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 120 place count 269 transition count 244
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 137 place count 252 transition count 227
Iterating global reduction 2 with 17 rules applied. Total rules applied 154 place count 252 transition count 227
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 154 place count 252 transition count 220
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 168 place count 245 transition count 220
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 324 place count 167 transition count 142
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 365 place count 167 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 166 transition count 141
Applied a total of 366 rules in 49 ms. Remains 166 /329 variables (removed 163) and now considering 141/304 (removed 163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 166/329 places, 141/304 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 166 cols
[2023-03-22 01:07:19] [INFO ] Computed 56 place invariants in 24 ms
[2023-03-22 01:07:19] [INFO ] [Real]Absence check using 54 positive place invariants in 7 ms returned sat
[2023-03-22 01:07:19] [INFO ] [Real]Absence check using 54 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-22 01:07:19] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:07:19] [INFO ] [Nat]Absence check using 54 positive place invariants in 7 ms returned sat
[2023-03-22 01:07:19] [INFO ] [Nat]Absence check using 54 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-22 01:07:19] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:07:19] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:07:20] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2023-03-22 01:07:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-22 01:07:20] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 01:07:20] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 141/141 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 1 place count 166 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 165 transition count 139
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 4 place count 164 transition count 139
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 162 transition count 137
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 162 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 160 transition count 135
Applied a total of 11 rules in 16 ms. Remains 160 /166 variables (removed 6) and now considering 135/141 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 160/166 places, 135/141 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1098285 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{}
Probabilistic random walk after 1098285 steps, saw 512118 distinct states, run finished after 3003 ms. (steps per millisecond=365 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 160 cols
[2023-03-22 01:07:23] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-22 01:07:23] [INFO ] [Real]Absence check using 51 positive place invariants in 26 ms returned sat
[2023-03-22 01:07:23] [INFO ] [Real]Absence check using 51 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 01:07:23] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:07:23] [INFO ] [Nat]Absence check using 51 positive place invariants in 41 ms returned sat
[2023-03-22 01:07:23] [INFO ] [Nat]Absence check using 51 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-22 01:07:23] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:07:23] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:07:23] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2023-03-22 01:07:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-22 01:07:23] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 01:07:23] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 135/135 transitions.
Applied a total of 0 rules in 39 ms. Remains 160 /160 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 160/160 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 135/135 transitions.
Applied a total of 0 rules in 16 ms. Remains 160 /160 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-22 01:07:23] [INFO ] Invariant cache hit.
[2023-03-22 01:07:24] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 01:07:24] [INFO ] Invariant cache hit.
[2023-03-22 01:07:24] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-22 01:07:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:07:24] [INFO ] Invariant cache hit.
[2023-03-22 01:07:24] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 160/160 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 01:07:24] [INFO ] Invariant cache hit.
[2023-03-22 01:07:24] [INFO ] [Real]Absence check using 51 positive place invariants in 31 ms returned sat
[2023-03-22 01:07:24] [INFO ] [Real]Absence check using 51 positive and 5 generalized place invariants in 32 ms returned sat
[2023-03-22 01:07:24] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:07:24] [INFO ] [Nat]Absence check using 51 positive place invariants in 7 ms returned sat
[2023-03-22 01:07:24] [INFO ] [Nat]Absence check using 51 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 01:07:24] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:07:25] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-22 01:07:25] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:07:25] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:07:25] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:07:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 295 ms
[2023-03-22 01:07:25] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 01:07:25] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-22 01:07:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 33 ms
FORMULA ShieldPPPs-PT-005B-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 15 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 304 transitions.
Support contains 99 out of 329 places (down from 101) after GAL structural reductions.
Computed a total of 73 stabilizing places and 73 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 308 transition count 283
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 307 transition count 282
Applied a total of 44 rules in 31 ms. Remains 307 /329 variables (removed 22) and now considering 282/304 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 307/329 places, 282/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 12 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 310 transition count 285
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 309 transition count 284
Applied a total of 40 rules in 20 ms. Remains 309 /329 variables (removed 20) and now considering 284/304 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 309/329 places, 284/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 23 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 309 transition count 284
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 309 transition count 284
Applied a total of 40 rules in 15 ms. Remains 309 /329 variables (removed 20) and now considering 284/304 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 309/329 places, 284/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 313 transition count 288
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 313 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 312 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 312 transition count 287
Applied a total of 34 rules in 19 ms. Remains 312 /329 variables (removed 17) and now considering 287/304 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 312/329 places, 287/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 310 transition count 285
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 310 transition count 285
Applied a total of 38 rules in 11 ms. Remains 310 /329 variables (removed 19) and now considering 285/304 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 310/329 places, 285/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 328 transition count 268
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 293 transition count 268
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 70 place count 293 transition count 242
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 122 place count 267 transition count 242
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 142 place count 247 transition count 222
Iterating global reduction 2 with 20 rules applied. Total rules applied 162 place count 247 transition count 222
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 162 place count 247 transition count 213
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 180 place count 238 transition count 213
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 332 place count 162 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 160 transition count 135
Applied a total of 334 rules in 37 ms. Remains 160 /329 variables (removed 169) and now considering 135/304 (removed 169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 160/329 places, 135/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 309 transition count 284
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 308 transition count 283
Applied a total of 42 rules in 12 ms. Remains 308 /329 variables (removed 21) and now considering 283/304 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 308/329 places, 283/304 transitions.
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:07:25] [INFO ] Flatten gal took : 12 ms
[2023-03-22 01:07:25] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 328 transition count 267
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 292 transition count 267
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 72 place count 292 transition count 241
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 124 place count 266 transition count 241
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 145 place count 245 transition count 220
Iterating global reduction 2 with 21 rules applied. Total rules applied 166 place count 245 transition count 220
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 166 place count 245 transition count 212
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 182 place count 237 transition count 212
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 338 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 157 transition count 132
Applied a total of 340 rules in 29 ms. Remains 157 /329 variables (removed 172) and now considering 132/304 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 157/329 places, 132/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 308 transition count 283
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 307 transition count 282
Applied a total of 44 rules in 25 ms. Remains 307 /329 variables (removed 22) and now considering 282/304 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 307/329 places, 282/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 308 transition count 283
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 307 transition count 282
Applied a total of 44 rules in 14 ms. Remains 307 /329 variables (removed 22) and now considering 282/304 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 307/329 places, 282/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 26 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 329 transition count 270
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 295 transition count 270
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 68 place count 295 transition count 244
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 120 place count 269 transition count 244
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 141 place count 248 transition count 223
Iterating global reduction 2 with 21 rules applied. Total rules applied 162 place count 248 transition count 223
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 162 place count 248 transition count 214
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 180 place count 239 transition count 214
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 334 place count 162 transition count 137
Applied a total of 334 rules in 24 ms. Remains 162 /329 variables (removed 167) and now considering 137/304 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 162/329 places, 137/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 328 transition count 266
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 291 transition count 266
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 291 transition count 241
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 266 transition count 241
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 144 place count 246 transition count 221
Iterating global reduction 2 with 20 rules applied. Total rules applied 164 place count 246 transition count 221
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 164 place count 246 transition count 212
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 182 place count 237 transition count 212
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 336 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 158 transition count 133
Applied a total of 338 rules in 37 ms. Remains 158 /329 variables (removed 171) and now considering 133/304 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 158/329 places, 133/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 19 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 309 transition count 284
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 308 transition count 283
Applied a total of 42 rules in 10 ms. Remains 308 /329 variables (removed 21) and now considering 283/304 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 308/329 places, 283/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 23 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 310 transition count 285
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 309 transition count 284
Applied a total of 40 rules in 8 ms. Remains 309 /329 variables (removed 20) and now considering 284/304 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 309/329 places, 284/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 8 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 9 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 304/304 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 328 transition count 270
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 295 transition count 270
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 66 place count 295 transition count 244
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 118 place count 269 transition count 244
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 137 place count 250 transition count 225
Iterating global reduction 2 with 19 rules applied. Total rules applied 156 place count 250 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 156 place count 250 transition count 220
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 245 transition count 220
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 320 place count 168 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 166 transition count 141
Applied a total of 322 rules in 20 ms. Remains 166 /329 variables (removed 163) and now considering 141/304 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 166/329 places, 141/304 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:07:26] [INFO ] Input system was already deterministic with 141 transitions.
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:07:26] [INFO ] Flatten gal took : 12 ms
[2023-03-22 01:07:26] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 01:07:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 329 places, 304 transitions and 848 arcs took 14 ms.
Total runtime 13195 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/604/ctl_0_ --ctl=/tmp/604/ctl_1_ --ctl=/tmp/604/ctl_2_ --ctl=/tmp/604/ctl_3_ --ctl=/tmp/604/ctl_4_ --ctl=/tmp/604/ctl_5_ --ctl=/tmp/604/ctl_6_ --ctl=/tmp/604/ctl_7_ --ctl=/tmp/604/ctl_8_ --ctl=/tmp/604/ctl_9_ --ctl=/tmp/604/ctl_10_ --ctl=/tmp/604/ctl_11_ --ctl=/tmp/604/ctl_12_ --ctl=/tmp/604/ctl_13_ --ctl=/tmp/604/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393236 kB
MemFree: 5377220 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16095548 kB
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-00
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-01
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-02
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-04
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-05
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-06
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-07
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-08
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-09
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-10
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-11
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-12
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-13
Could not compute solution for formula : ShieldPPPs-PT-005B-CTLFireability-15

BK_STOP 1679450818381

--------------------
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 ShieldPPPs-PT-005B-CTLFireability-00
ctl formula formula --ctl=/tmp/604/ctl_0_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-01
ctl formula formula --ctl=/tmp/604/ctl_1_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-02
ctl formula formula --ctl=/tmp/604/ctl_2_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-03
ctl formula formula --ctl=/tmp/604/ctl_3_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-04
ctl formula formula --ctl=/tmp/604/ctl_4_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-05
ctl formula formula --ctl=/tmp/604/ctl_5_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-06
ctl formula formula --ctl=/tmp/604/ctl_6_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-07
ctl formula formula --ctl=/tmp/604/ctl_7_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-08
ctl formula formula --ctl=/tmp/604/ctl_8_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-09
ctl formula formula --ctl=/tmp/604/ctl_9_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-10
ctl formula formula --ctl=/tmp/604/ctl_10_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-11
ctl formula formula --ctl=/tmp/604/ctl_11_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-12
ctl formula formula --ctl=/tmp/604/ctl_12_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-13
ctl formula formula --ctl=/tmp/604/ctl_13_
ctl formula name ShieldPPPs-PT-005B-CTLFireability-15
ctl formula formula --ctl=/tmp/604/ctl_14_
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 329 places, 304 transitions and 848 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 304->304 groups
pnml2lts-sym: Regrouping took 0.050 real 0.040 user 0.000 sys
pnml2lts-sym: state vector length is 329; there are 304 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: 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: 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: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 610
Killing (9) : 610

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="ShieldPPPs-PT-005B"
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 ShieldPPPs-PT-005B, 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 r393-oct2-167903717000426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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