Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820400099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IBMB2S565S3960-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 11K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 127K May 10 09:34 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 IBMB2S565S3960-PT-none-LTLCardinality-00
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-01
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-02
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-03
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-04
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-05
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-06
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-07
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-08
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-09
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-10
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-11
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-12
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-13
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-14
FORMULA_NAME IBMB2S565S3960-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652745663345

Running Version 202205111006
[2022-05-17 00:01:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:01:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:01:04] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-17 00:01:04] [INFO ] Transformed 273 places.
[2022-05-17 00:01:04] [INFO ] Transformed 179 transitions.
[2022-05-17 00:01:04] [INFO ] Parsed PT model containing 273 places and 179 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 89 places
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 176 transition count 178
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 114 place count 160 transition count 162
Iterating global reduction 1 with 16 rules applied. Total rules applied 130 place count 160 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 131 place count 160 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 158 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 158 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 157 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 157 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 156 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 156 transition count 157
Applied a total of 139 rules in 61 ms. Remains 156 /273 variables (removed 117) and now considering 157/179 (removed 22) transitions.
// Phase 1: matrix 157 rows 156 cols
[2022-05-17 00:01:04] [INFO ] Computed 8 place invariants in 11 ms
[2022-05-17 00:01:05] [INFO ] Implicit Places using invariants in 174 ms returned [127, 144]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 201 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/273 places, 157/179 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 156
Applied a total of 2 rules in 7 ms. Remains 153 /154 variables (removed 1) and now considering 156/157 (removed 1) transitions.
// Phase 1: matrix 156 rows 153 cols
[2022-05-17 00:01:05] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-17 00:01:05] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 156 rows 153 cols
[2022-05-17 00:01:05] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-17 00:01:05] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/273 places, 156/179 transitions.
Finished structural reductions, in 2 iterations. Remains : 153/273 places, 156/179 transitions.
Support contains 37 out of 153 places after structural reductions.
[2022-05-17 00:01:05] [INFO ] Flatten gal took : 33 ms
[2022-05-17 00:01:05] [INFO ] Flatten gal took : 13 ms
[2022-05-17 00:01:05] [INFO ] Input system was already deterministic with 156 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 156 rows 153 cols
[2022-05-17 00:01:06] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 00:01:06] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 00:01:06] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-05-17 00:01:06] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 00:01:06] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2022-05-17 00:01:06] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-17 00:01:06] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 446 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=37 )
Parikh walk visited 3 properties in 19 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 65 stabilizing places and 67 stable transitions
Graph (complete) has 179 edges and 153 vertex of which 101 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(X(p0))&&X(F(p1)))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 144 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 141 transition count 148
Applied a total of 20 rules in 20 ms. Remains 141 /153 variables (removed 12) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:07] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 00:01:07] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:07] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:07] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:07] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:07] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/153 places, 148/156 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 2 s49), p0:(GT 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19983 reset in 227 ms.
Product exploration explored 100000 steps with 20038 reset in 146 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Finished random walk after 3659 steps, including 15 resets, run visited all 2 properties in 12 ms. (steps per millisecond=304 )
Knowledge obtained : [(AND p1 p0), (X (X p1)), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 280 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:09] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 00:01:09] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:09] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:09] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:09] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 148/148 transitions.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Finished random walk after 2228 steps, including 8 resets, run visited all 2 properties in 6 ms. (steps per millisecond=371 )
Knowledge obtained : [(AND p1 p0), (X (X p1)), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 20034 reset in 96 ms.
Product exploration explored 100000 steps with 19973 reset in 94 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 148/148 transitions.
Graph (trivial) has 126 edges and 141 vertex of which 12 / 141 are part of one of the 1 SCC in 3 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 152 edges and 130 vertex of which 120 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 120 transition count 126
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 52 place count 120 transition count 127
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 73 place count 120 transition count 127
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 105 place count 88 transition count 95
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 137 place count 88 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 156 place count 88 transition count 96
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 178 place count 66 transition count 74
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 200 place count 66 transition count 74
Performed 9 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 209 place count 66 transition count 108
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 214 place count 66 transition count 103
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 226 place count 54 transition count 76
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 238 place count 54 transition count 76
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 238 rules in 33 ms. Remains 54 /141 variables (removed 87) and now considering 76/148 (removed 72) transitions.
[2022-05-17 00:01:11] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 76 rows 54 cols
[2022-05-17 00:01:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:11] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/141 places, 76/148 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/141 places, 76/148 transitions.
Product exploration explored 100000 steps with 19935 reset in 228 ms.
Product exploration explored 100000 steps with 19955 reset in 196 ms.
Built C files in :
/tmp/ltsmin14378435719040407387
[2022-05-17 00:01:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14378435719040407387
Running compilation step : cd /tmp/ltsmin14378435719040407387;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin14378435719040407387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14378435719040407387;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15739501704254882449.hoa' '--buchi-type=spotba'
LTSmin run took 392 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-00 finished in 5544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(F(X(p1)) U p1)||p0)))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 123 edges and 153 vertex of which 12 / 153 are part of one of the 1 SCC in 1 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 167 edges and 142 vertex of which 93 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 43 output transitions
Drop transitions removed 43 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 90 transition count 50
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 40 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 39 transition count 49
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 104 place count 39 transition count 39
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 124 place count 29 transition count 39
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 136 place count 23 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 21 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 21 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 20 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 19 transition count 28
Ensure Unique test removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 18 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 17 transition count 27
Applied a total of 149 rules in 13 ms. Remains 17 /153 variables (removed 136) and now considering 27/156 (removed 129) transitions.
// Phase 1: matrix 27 rows 17 cols
[2022-05-17 00:01:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:01:12] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 27 rows 17 cols
[2022-05-17 00:01:12] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:12] [INFO ] Implicit Places using invariants and state equation in 29 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/153 places, 27/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/153 places, 27/156 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p1, (AND p1 (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 1 s5), p0:(OR (GT s3 s4) (GT s8 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 75 steps with 1 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-02 finished in 159 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((F(!F(p0)) U p1)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 128 edges and 153 vertex of which 19 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 159 edges and 135 vertex of which 108 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Ensure Unique test removed 2 places
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 106 transition count 50
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 44 transition count 50
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 126 place count 44 transition count 35
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 158 place count 27 transition count 35
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 26 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 25 transition count 34
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 178 place count 16 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 180 place count 16 transition count 23
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 5 with 2 rules applied. Total rules applied 182 place count 15 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 14 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 185 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 14 transition count 19
Applied a total of 187 rules in 7 ms. Remains 14 /153 variables (removed 139) and now considering 19/156 (removed 137) transitions.
// Phase 1: matrix 19 rows 14 cols
[2022-05-17 00:01:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:12] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 19 rows 14 cols
[2022-05-17 00:01:12] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/153 places, 18/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 13/153 places, 18/156 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s3 s4), p0:(LEQ 1 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4224 steps with 161 reset in 17 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-03 finished in 175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p0)||p1))||G(((p1 U p2)||p1)))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 144 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 141 transition count 148
Applied a total of 20 rules in 11 ms. Remains 141 /153 variables (removed 12) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:12] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-17 00:01:12] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:13] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:13] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/153 places, 148/156 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s45 s61), p1:(LEQ 3 s121), p2:(LEQ 2 s129)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-04 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(G(F(p0))))&&p1)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 130 edges and 153 vertex of which 19 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 159 edges and 135 vertex of which 113 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 110 transition count 52
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 47 transition count 52
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 128 place count 47 transition count 35
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 164 place count 28 transition count 35
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 167 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 25 transition count 33
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 24 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 24 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 185 place count 17 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 187 place count 17 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 191 place count 15 transition count 24
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 194 place count 15 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 14 transition count 20
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 196 place count 13 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 12 transition count 19
Applied a total of 197 rules in 8 ms. Remains 12 /153 variables (removed 141) and now considering 19/156 (removed 137) transitions.
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 00:01:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 00:01:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/153 places, 18/156 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 3 ms. Remains 10 /11 variables (removed 1) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 00:01:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 00:01:13] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/153 places, 16/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/153 places, 16/156 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s2), p1:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-05 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(p0) U (X(F(p1))&&p0)))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 146 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 146 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 145 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 145 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 144 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 143 transition count 150
Applied a total of 16 rules in 13 ms. Remains 143 /153 variables (removed 10) and now considering 150/156 (removed 6) transitions.
// Phase 1: matrix 150 rows 143 cols
[2022-05-17 00:01:13] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 150 rows 143 cols
[2022-05-17 00:01:13] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-17 00:01:13] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 143 cols
[2022-05-17 00:01:13] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 00:01:13] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 150/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/153 places, 150/156 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT 1 s130), p0:(LEQ s66 s127)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Computed a total of 62 stabilizing places and 66 stable transitions
Graph (complete) has 166 edges and 143 vertex of which 98 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Computed a total of 62 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-07 finished in 696 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 144 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 143 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 142 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 142 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 141 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 141 transition count 148
Applied a total of 20 rules in 14 ms. Remains 141 /153 variables (removed 12) and now considering 148/156 (removed 8) transitions.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 148 rows 141 cols
[2022-05-17 00:01:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:14] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 148/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/153 places, 148/156 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s140 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 164 edges and 141 vertex of which 97 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.4 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/141 stabilizing places and 65/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-08 finished in 585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 131 edges and 153 vertex of which 19 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 159 edges and 135 vertex of which 94 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Discarding 41 places :
Also discarding 36 output transitions
Drop transitions removed 36 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 91 transition count 45
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 37 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 110 place count 37 transition count 32
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 136 place count 24 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 150 place count 17 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 153 place count 17 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 15 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 159 place count 15 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 14 transition count 19
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 12 transition count 18
Applied a total of 163 rules in 13 ms. Remains 12 /153 variables (removed 141) and now considering 18/156 (removed 138) transitions.
// Phase 1: matrix 18 rows 12 cols
[2022-05-17 00:01:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 18 rows 12 cols
[2022-05-17 00:01:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/153 places, 17/156 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 16
Applied a total of 1 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 11 cols
[2022-05-17 00:01:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 16 rows 11 cols
[2022-05-17 00:01:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/153 places, 16/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/153 places, 16/156 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-10 finished in 156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(X(G(p0)))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 132 edges and 153 vertex of which 19 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 159 edges and 135 vertex of which 83 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.1 ms
Discarding 52 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 80 transition count 42
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 33 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 32 transition count 41
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 98 place count 32 transition count 33
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 114 place count 24 transition count 33
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 130 place count 16 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 16 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 135 place count 15 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 15 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 14 transition count 17
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 13 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 12 transition count 16
Applied a total of 142 rules in 6 ms. Remains 12 /153 variables (removed 141) and now considering 16/156 (removed 140) transitions.
// Phase 1: matrix 16 rows 12 cols
[2022-05-17 00:01:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:14] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2022-05-17 00:01:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-17 00:01:15] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 16 rows 12 cols
[2022-05-17 00:01:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/153 places, 16/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/153 places, 16/156 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 233 steps with 6 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-11 finished in 153 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p0))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 130 edges and 153 vertex of which 19 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 159 edges and 135 vertex of which 83 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.0 ms
Discarding 52 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 80 transition count 42
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 33 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 32 transition count 41
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 98 place count 32 transition count 31
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 118 place count 22 transition count 31
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 134 place count 14 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 137 place count 14 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 12 transition count 21
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 12 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 146 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 11 transition count 15
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 9 transition count 14
Applied a total of 149 rules in 5 ms. Remains 9 /153 variables (removed 144) and now considering 14/156 (removed 142) transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 00:01:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 00:01:15] [INFO ] Computed 0 place invariants in 14 ms
[2022-05-17 00:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [3]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 112 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/153 places, 13/156 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 12
Applied a total of 1 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 8 cols
[2022-05-17 00:01:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 12 rows 8 cols
[2022-05-17 00:01:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-17 00:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/153 places, 12/156 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/153 places, 12/156 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-12 finished in 229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(p0 U G((X(G(p1))||X(p0)))))||p2)))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 149 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 9 place count 144 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 144 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 143 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 143 transition count 150
Applied a total of 16 rules in 10 ms. Remains 143 /153 variables (removed 10) and now considering 150/156 (removed 6) transitions.
// Phase 1: matrix 150 rows 143 cols
[2022-05-17 00:01:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 150 rows 143 cols
[2022-05-17 00:01:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:01:15] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 143 cols
[2022-05-17 00:01:15] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 00:01:15] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 150/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/153 places, 150/156 transitions.
Stuttering acceptance computed with spot in 168 ms :[p1, (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR p1 p0), (OR p0 p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s3), p2:(LEQ s41 s63), p0:(LEQ s56 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 61 stabilizing places and 65 stable transitions
Graph (complete) has 167 edges and 143 vertex of which 97 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.2 ms
Computed a total of 61 stabilizing places and 65 stable transitions
Detected a total of 61/143 stabilizing places and 65/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p0)))
Knowledge based reduction with 6 factoid took 92 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-14 finished in 761 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U p2))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 124 edges and 153 vertex of which 19 / 153 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 159 edges and 135 vertex of which 97 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 94 transition count 50
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 42 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 41 transition count 49
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 108 place count 41 transition count 36
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 135 place count 27 transition count 36
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 149 place count 20 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 20 transition count 27
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 4 with 2 rules applied. Total rules applied 152 place count 19 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 19 transition count 27
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 156 place count 19 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 18 transition count 23
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 17 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 16 transition count 22
Applied a total of 160 rules in 18 ms. Remains 16 /153 variables (removed 137) and now considering 22/156 (removed 134) transitions.
// Phase 1: matrix 22 rows 16 cols
[2022-05-17 00:01:16] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-17 00:01:16] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 22 rows 16 cols
[2022-05-17 00:01:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-17 00:01:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:01:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned [8]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/153 places, 21/156 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/153 places, 21/156 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 2 s2), p1:(OR (LEQ 1 s4) (LEQ s11 s5)), p0:(LEQ s11 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-LTLCardinality-15 finished in 201 ms.
All properties solved by simple procedures.
Total runtime 11853 ms.

BK_STOP 1652745676387

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is IBMB2S565S3960-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820400099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;