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.r078-tall-165260109700027.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 DiscoveryGPU-PT-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109700027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 6.9K Apr 30 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 07:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 07:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:33 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 DiscoveryGPU-PT-07b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652628878110

Running Version 202205111006
[2022-05-15 15:34:39] [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-15 15:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:34:39] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-15 15:34:39] [INFO ] Transformed 212 places.
[2022-05-15 15:34:39] [INFO ] Transformed 224 transitions.
[2022-05-15 15:34:39] [INFO ] Found NUPN structural information;
[2022-05-15 15:34:39] [INFO ] Parsed PT model containing 212 places and 224 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 224/224 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 201 transition count 224
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 42 place count 170 transition count 193
Iterating global reduction 1 with 31 rules applied. Total rules applied 73 place count 170 transition count 193
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 164 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 164 transition count 187
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 160 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 160 transition count 183
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 156 transition count 179
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 156 transition count 179
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 152 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 152 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 113 place count 148 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 117 place count 148 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 145 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 145 transition count 164
Applied a total of 123 rules in 63 ms. Remains 145 /212 variables (removed 67) and now considering 164/224 (removed 60) transitions.
// Phase 1: matrix 164 rows 145 cols
[2022-05-15 15:34:39] [INFO ] Computed 3 place invariants in 10 ms
[2022-05-15 15:34:39] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 164 rows 145 cols
[2022-05-15 15:34:39] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-15 15:34:39] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 145 cols
[2022-05-15 15:34:40] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-15 15:34:40] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/212 places, 164/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/212 places, 164/224 transitions.
Support contains 30 out of 145 places after structural reductions.
[2022-05-15 15:34:40] [INFO ] Flatten gal took : 39 ms
[2022-05-15 15:34:40] [INFO ] Flatten gal took : 15 ms
[2022-05-15 15:34:40] [INFO ] Input system was already deterministic with 164 transitions.
Finished random walk after 642 steps, including 2 resets, run visited all 18 properties in 69 ms. (steps per millisecond=9 )
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 274 edges and 145 vertex of which 135 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(p0 U !G(p1)))||F(X(p0)))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 133 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 133 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 131 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 131 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 129 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 129 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 127 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 127 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 125 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 125 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 123 transition count 143
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 123 transition count 143
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 121 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 121 transition count 141
Applied a total of 45 rules in 21 ms. Remains 121 /145 variables (removed 24) and now considering 141/164 (removed 23) transitions.
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:40] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:40] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/145 places, 141/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/145 places, 141/164 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s61 1), p0:(OR (EQ s113 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22258 reset in 233 ms.
Product exploration explored 100000 steps with 22191 reset in 137 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:34:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 15:34:42] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 15:34:42] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2022-05-15 15:34:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-15 15:34:42] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-15 15:34:42] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:42] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 141 rows 121 cols
[2022-05-15 15:34:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:42] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 141/141 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 241 edges and 121 vertex of which 119 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22492 reset in 85 ms.
Product exploration explored 100000 steps with 22262 reset in 79 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Graph (complete) has 241 edges and 121 vertex of which 120 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 120 transition count 140
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 15 place count 120 transition count 140
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 38 place count 120 transition count 140
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 55 place count 120 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 117 transition count 143
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 117 transition count 143
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 76 place count 117 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 111 transition count 161
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 111 transition count 161
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 106 place count 93 transition count 131
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 124 place count 93 transition count 131
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 140 place count 77 transition count 105
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 156 place count 77 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 161 place count 72 transition count 100
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 166 place count 72 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 176 place count 62 transition count 85
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 186 place count 62 transition count 85
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 206 place count 42 transition count 55
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 226 place count 42 transition count 55
Deduced a syphon composed of 23 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 231 place count 42 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 233 place count 40 transition count 48
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 235 place count 40 transition count 48
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 235 rules in 41 ms. Remains 40 /121 variables (removed 81) and now considering 48/141 (removed 93) transitions.
[2022-05-15 15:34:44] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:44] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 40 cols
[2022-05-15 15:34:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:34:44] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/121 places, 48/141 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/121 places, 48/141 transitions.
Product exploration explored 100000 steps with 26679 reset in 241 ms.
Product exploration explored 100000 steps with 26667 reset in 188 ms.
Built C files in :
/tmp/ltsmin841490049532421531
[2022-05-15 15:34:44] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin841490049532421531
Running compilation step : cd /tmp/ltsmin841490049532421531;'/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 332 ms.
Running link step : cd /tmp/ltsmin841490049532421531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin841490049532421531;'/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/stateBased15240213982469500326.hoa' '--buchi-type=spotba'
LTSmin run took 179 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-01 finished in 4403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)&&X((X(p2)&&p3))))'
Support contains 7 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 134 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 134 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 132 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 132 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 130 transition count 151
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 130 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 129 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 129 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 128 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 128 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 127 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 127 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 126 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 126 transition count 146
Applied a total of 36 rules in 12 ms. Remains 126 /145 variables (removed 19) and now considering 146/164 (removed 18) transitions.
// Phase 1: matrix 146 rows 126 cols
[2022-05-15 15:34:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:45] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 146 rows 126 cols
[2022-05-15 15:34:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 146 rows 126 cols
[2022-05-15 15:34:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/145 places, 146/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/145 places, 146/164 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p3) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}]], initial=0, aps=[p1:(OR (EQ s63 0) (EQ s75 1)), p0:(OR (EQ s50 0) (EQ s102 1)), p3:(EQ s53 0), p2:(OR (EQ s42 0) (EQ s109 1))], 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 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 96 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Graph (complete) has 250 edges and 126 vertex of which 123 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p3), (X p0), (X (NOT (AND (NOT p1) p0))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 10 factoid took 251 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-04 finished in 914 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(X(p0))))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Graph (complete) has 274 edges and 145 vertex of which 135 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 134 transition count 138
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 116 transition count 138
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 37 place count 116 transition count 114
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 85 place count 92 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 89 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 89 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 87 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 87 transition count 109
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 85 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 85 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 83 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 83 transition count 103
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 167 place count 51 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 45 transition count 59
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 45 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 39 transition count 53
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 39 transition count 53
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 33 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 33 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 208 place count 28 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 213 place count 28 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 218 place count 23 transition count 26
Iterating global reduction 2 with 5 rules applied. Total rules applied 223 place count 23 transition count 26
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 227 place count 19 transition count 22
Iterating global reduction 2 with 4 rules applied. Total rules applied 231 place count 19 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 19 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 17 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 239 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 10 transition count 14
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 243 place count 9 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 9 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 247 place count 7 transition count 10
Applied a total of 247 rules in 31 ms. Remains 7 /145 variables (removed 138) and now considering 10/164 (removed 154) transitions.
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-15 15:34:46] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/145 places, 10/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/145 places, 10/164 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-06 finished in 180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(X(!(X(p0) U p1)))))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Graph (complete) has 274 edges and 145 vertex of which 135 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 134 transition count 138
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 116 transition count 138
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 37 place count 116 transition count 116
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 81 place count 94 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 92 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 92 transition count 114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 91 transition count 113
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 91 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 90 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 90 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 89 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 89 transition count 110
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 155 place count 57 transition count 78
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 52 transition count 68
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 52 transition count 68
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 47 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 47 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 42 transition count 53
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 42 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 37 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 37 transition count 48
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 33 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 33 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 207 place count 29 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 29 transition count 36
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 29 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 29 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 27 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 224 place count 22 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 229 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 229 place count 17 transition count 23
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 231 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 14 transition count 21
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 239 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 11 transition count 17
Applied a total of 242 rules in 30 ms. Remains 11 /145 variables (removed 134) and now considering 17/164 (removed 147) transitions.
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-15 15:34:46] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/145 places, 17/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/145 places, 17/164 transitions.
Stuttering acceptance computed with spot in 32 ms :[p1]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s7 1))], 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-07 finished in 147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p0)||F(F(p1))))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Graph (complete) has 274 edges and 145 vertex of which 137 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 136 transition count 139
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 118 transition count 139
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 37 place count 118 transition count 115
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 85 place count 94 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 91 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 91 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 89 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 87 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 87 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 85 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 85 transition count 104
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 165 place count 54 transition count 73
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 48 transition count 61
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 48 transition count 61
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 42 transition count 55
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 42 transition count 55
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 37 transition count 45
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 37 transition count 45
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 32 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 32 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 27 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 27 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 224 place count 22 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 229 place count 22 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 22 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 22 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 21 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 236 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 238 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 14 transition count 18
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 249 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 9 transition count 12
Applied a total of 250 rules in 28 ms. Remains 9 /145 variables (removed 136) and now considering 12/164 (removed 152) transitions.
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-15 15:34:46] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:46] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 15:34:46] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/145 places, 12/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/145 places, 12/164 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 1)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-08 finished in 194 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||X(p2)||p0))&&F(p3)))'
Support contains 8 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 164
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 138 transition count 159
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 138 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 136 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 136 transition count 157
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 134 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 134 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 132 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 132 transition count 153
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 130 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 130 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 128 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 128 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 126 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 126 transition count 145
Applied a total of 36 rules in 17 ms. Remains 126 /145 variables (removed 19) and now considering 145/164 (removed 19) transitions.
// Phase 1: matrix 145 rows 126 cols
[2022-05-15 15:34:46] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 145 rows 126 cols
[2022-05-15 15:34:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 145 rows 126 cols
[2022-05-15 15:34:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:46] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/145 places, 145/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/145 places, 145/164 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(OR (EQ s98 0) (EQ s114 1)), p0:(OR (EQ s8 0) (EQ s61 1)), p1:(AND (OR (EQ s66 0) (EQ s71 1)) (OR (EQ s8 0) (EQ s61 1))), p2:(OR (EQ s122 0) (EQ s50 1)...], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 245 edges and 126 vertex of which 122 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p3 p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p3), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p3))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 7 states, 11 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-10 finished in 1008 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 142 transition count 164
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 132 transition count 154
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 132 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 130 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 128 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 128 transition count 150
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 126 transition count 148
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 126 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 124 transition count 144
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 124 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 122 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 120 transition count 140
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 120 transition count 140
Applied a total of 47 rules in 13 ms. Remains 120 /145 variables (removed 25) and now considering 140/164 (removed 24) transitions.
// Phase 1: matrix 140 rows 120 cols
[2022-05-15 15:34:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:47] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 140 rows 120 cols
[2022-05-15 15:34:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:34:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 120 cols
[2022-05-15 15:34:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:34:47] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/145 places, 140/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 120/145 places, 140/164 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s51 0) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-12 finished in 292 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(p1)))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 164/164 transitions.
Graph (complete) has 274 edges and 145 vertex of which 139 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 138 transition count 143
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 122 transition count 143
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 33 place count 122 transition count 119
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 81 place count 98 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 97 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 97 transition count 118
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 147 place count 65 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 62 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 62 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 59 transition count 77
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 59 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 57 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 55 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 169 place count 53 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 171 place count 53 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 173 place count 51 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 175 place count 51 transition count 65
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 51 transition count 62
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 51 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 49 transition count 60
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 53 edges and 47 vertex of which 44 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 2 with 14 rules applied. Total rules applied 197 place count 44 transition count 46
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 209 place count 33 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 32 transition count 45
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 5 with 12 rules applied. Total rules applied 222 place count 26 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 26 transition count 38
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 228 place count 21 transition count 33
Applied a total of 228 rules in 22 ms. Remains 21 /145 variables (removed 124) and now considering 33/164 (removed 131) transitions.
[2022-05-15 15:34:47] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 15:34:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 15:34:47] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 15:34:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-15 15:34:47] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:34:47] [INFO ] Flow matrix only has 25 transitions (discarded 8 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 15:34:47] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:34:47] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/145 places, 33/164 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/145 places, 33/164 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 0) (EQ s19 1)), p1:(AND (EQ s10 0) (EQ s19 1) (OR (EQ s4 0) (EQ s15 1)) (OR (EQ s17 0) (EQ s6 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07b-LTLCardinality-15 finished in 149 ms.
All properties solved by simple procedures.
Total runtime 8726 ms.

BK_STOP 1652628888029

--------------------
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="DiscoveryGPU-PT-07b"
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 DiscoveryGPU-PT-07b, 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 r078-tall-165260109700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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