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-165260109900147.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-15a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109900147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 07:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 07:09 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.6K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 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 53K 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-15a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-15a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652636627782

Running Version 202205111006
[2022-05-15 17:43:48] [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 17:43:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:43:49] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-05-15 17:43:49] [INFO ] Transformed 153 places.
[2022-05-15 17:43:49] [INFO ] Transformed 211 transitions.
[2022-05-15 17:43:49] [INFO ] Found NUPN structural information;
[2022-05-15 17:43:49] [INFO ] Parsed PT model containing 153 places and 211 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 211/211 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 202
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 202
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 137 transition count 195
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 137 transition count 195
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 133 transition count 187
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 133 transition count 187
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 51 place count 133 transition count 176
Applied a total of 51 rules in 35 ms. Remains 133 /153 variables (removed 20) and now considering 176/211 (removed 35) transitions.
// Phase 1: matrix 176 rows 133 cols
[2022-05-15 17:43:49] [INFO ] Computed 2 place invariants in 13 ms
[2022-05-15 17:43:49] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 176 rows 133 cols
[2022-05-15 17:43:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:43:49] [INFO ] State equation strengthened by 113 read => feed constraints.
[2022-05-15 17:43:49] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 407 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/153 places, 176/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/153 places, 176/211 transitions.
Support contains 30 out of 132 places after structural reductions.
[2022-05-15 17:43:49] [INFO ] Flatten gal took : 35 ms
[2022-05-15 17:43:49] [INFO ] Flatten gal took : 14 ms
[2022-05-15 17:43:49] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 28 out of 132 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 132 cols
[2022-05-15 17:43:50] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-15 17:43:50] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 17:43:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 17:43:50] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 335 edges and 132 vertex of which 126 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U X(p1)))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 176/176 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 167
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 113 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 113 transition count 157
Applied a total of 38 rules in 19 ms. Remains 113 /132 variables (removed 19) and now considering 157/176 (removed 19) transitions.
// Phase 1: matrix 157 rows 113 cols
[2022-05-15 17:43:50] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 17:43:50] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 157 rows 113 cols
[2022-05-15 17:43:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 17:43:50] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 113 cols
[2022-05-15 17:43:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:50] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/132 places, 157/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/132 places, 157/176 transitions.
Stuttering acceptance computed with spot in 1457 ms :[p1, p1, true]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s69 1)), p1:(OR (EQ s42 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 5 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-01 finished in 1788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 176/176 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 167
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 112 transition count 156
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 112 transition count 156
Applied a total of 40 rules in 11 ms. Remains 112 /132 variables (removed 20) and now considering 156/176 (removed 20) transitions.
// Phase 1: matrix 156 rows 112 cols
[2022-05-15 17:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:52] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 156 rows 112 cols
[2022-05-15 17:43:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:43:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 17:43:52] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 112 cols
[2022-05-15 17:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:52] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/132 places, 156/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/132 places, 156/176 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-07 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 (NEQ s53 0) (NEQ s11 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-15a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-07 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0)&&G(p0)))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 176/176 transitions.
Graph (complete) has 335 edges and 132 vertex of which 126 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 146 edges and 124 vertex of which 108 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Graph (trivial) has 121 edges and 108 vertex of which 60 / 108 are part of one of the 30 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 78 transition count 138
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 64 place count 63 transition count 108
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 76 place count 51 transition count 84
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 51 transition count 84
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 39 transition count 60
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 39 transition count 60
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 124 place count 27 transition count 36
Iterating global reduction 2 with 12 rules applied. Total rules applied 136 place count 27 transition count 36
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 148 place count 15 transition count 24
Iterating global reduction 2 with 12 rules applied. Total rules applied 160 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 9 transition count 17
Applied a total of 170 rules in 26 ms. Remains 9 /132 variables (removed 123) and now considering 17/176 (removed 159) transitions.
[2022-05-15 17:43:52] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2022-05-15 17:43:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:43:52] [INFO ] Implicit Places using invariants in 13 ms returned []
[2022-05-15 17:43:52] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2022-05-15 17:43:52] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 17:43:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-15 17:43:52] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:43:52] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2022-05-15 17:43:52] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 17:43:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/132 places, 17/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/132 places, 17/176 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s5 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 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-08 finished in 132 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(((p0 U X(p1))||F(p2)))))))'
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 176/176 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 122 transition count 166
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 122 transition count 166
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 115 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 115 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 110 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 110 transition count 154
Applied a total of 44 rules in 12 ms. Remains 110 /132 variables (removed 22) and now considering 154/176 (removed 22) transitions.
// Phase 1: matrix 154 rows 110 cols
[2022-05-15 17:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:52] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 154 rows 110 cols
[2022-05-15 17:43:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:52] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 17:43:53] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2022-05-15 17:43:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:43:53] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/132 places, 154/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/132 places, 154/176 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(OR (EQ s20 0) (EQ s15 1) (EQ s75 0) (EQ s45 1)), p1:(OR (EQ s62 0) (EQ s46 1))], 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 25000 reset in 337 ms.
Product exploration explored 100000 steps with 25000 reset in 207 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 306 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 62 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Finished Best-First random walk after 1533 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=766 )
Knowledge obtained : [(AND p2 p1), true]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 154/154 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 110 cols
[2022-05-15 17:43:54] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 17:43:54] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 154 rows 110 cols
[2022-05-15 17:43:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:54] [INFO ] State equation strengthened by 76 read => feed constraints.
[2022-05-15 17:43:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2022-05-15 17:43:55] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 17:43:55] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 154/154 transitions.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 306 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p2 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 60 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Finished Best-First random walk after 1761 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=587 )
Knowledge obtained : [(AND p2 p1), true]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 176 ms.
Product exploration explored 100000 steps with 25000 reset in 173 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 154/154 transitions.
Graph (complete) has 306 edges and 110 vertex of which 109 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 109 transition count 153
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 153
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 27 rules applied. Total rules applied 29 place count 109 transition count 180
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 41 place count 97 transition count 156
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 53 place count 97 transition count 156
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 75 place count 75 transition count 112
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 97 place count 75 transition count 112
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 107 place count 65 transition count 102
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 117 place count 65 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 126 place count 56 transition count 84
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 135 place count 56 transition count 84
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 152 place count 39 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 169 place count 39 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 169 rules in 31 ms. Remains 39 /110 variables (removed 71) and now considering 58/154 (removed 96) transitions.
[2022-05-15 17:43:57] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:43:57] [INFO ] Flow matrix only has 53 transitions (discarded 5 similar events)
// Phase 1: matrix 53 rows 39 cols
[2022-05-15 17:43:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:43:57] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/110 places, 58/154 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/110 places, 58/154 transitions.
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Built C files in :
/tmp/ltsmin738302916416098579
[2022-05-15 17:43:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin738302916416098579
Running compilation step : cd /tmp/ltsmin738302916416098579;'/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 324 ms.
Running link step : cd /tmp/ltsmin738302916416098579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin738302916416098579;'/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/stateBased11032920535052100182.hoa' '--buchi-type=spotba'
LTSmin run took 152 ms.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-09 finished in 5638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!G(p0) U X(p1))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 176/176 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 167
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 113 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 113 transition count 157
Applied a total of 38 rules in 10 ms. Remains 113 /132 variables (removed 19) and now considering 157/176 (removed 19) transitions.
// Phase 1: matrix 157 rows 113 cols
[2022-05-15 17:43:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:58] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 157 rows 113 cols
[2022-05-15 17:43:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 17:43:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 113 cols
[2022-05-15 17:43:58] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:58] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/132 places, 157/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/132 places, 157/176 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s100 0) (EQ s95 1)), p1:(OR (EQ s88 0) (EQ s16 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 199 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 310 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-11 finished in 1019 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(X(p1))||p0))||X(p2)||p3)))'
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 176/176 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 124 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 124 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 118 transition count 162
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 118 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 114 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 114 transition count 158
Applied a total of 36 rules in 9 ms. Remains 114 /132 variables (removed 18) and now considering 158/176 (removed 18) transitions.
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:43:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:43:59] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:43:59] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-15 17:43:59] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 17:43:59] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:43:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:43:59] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/132 places, 158/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/132 places, 158/176 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (EQ s45 0) (EQ s61 1)), p0:(OR (EQ s39 0) (EQ s31 1)), p2:(AND (EQ s106 0) (EQ s74 1)), p1:(OR (EQ s61 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33433 reset in 180 ms.
Product exploration explored 100000 steps with 33242 reset in 279 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 311 edges and 114 vertex of which 112 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 4 AP to 3 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Finished random walk after 322 steps, including 1 resets, run visited all 3 properties in 10 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F p3), (F (NOT p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 4 AP to 3 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 158/158 transitions.
Applied a total of 0 rules in 4 ms. Remains 114 /114 variables (removed 0) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:44:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:01] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:44:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 17:44:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:44:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:01] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 158/158 transitions.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 311 edges and 114 vertex of which 112 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 4 AP to 3 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Finished random walk after 111 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p3) p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p1))]
False Knowledge obtained : [(F p3), (F (NOT p1)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 1608 ms. Reduced automaton from 3 states, 4 edges and 4 AP to 3 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33357 reset in 175 ms.
Product exploration explored 100000 steps with 33181 reset in 190 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1)]
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 158/158 transitions.
Graph (complete) has 311 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 113 transition count 157
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 113 transition count 183
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 102 transition count 161
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 102 transition count 161
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 73 place count 80 transition count 117
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 95 place count 80 transition count 117
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 105 place count 70 transition count 107
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 115 place count 70 transition count 107
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 125 place count 60 transition count 87
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 135 place count 60 transition count 87
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 154 place count 41 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 173 place count 41 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 173 rules in 17 ms. Remains 41 /114 variables (removed 73) and now considering 58/158 (removed 100) transitions.
[2022-05-15 17:44:04] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:44:04] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
// Phase 1: matrix 54 rows 41 cols
[2022-05-15 17:44:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:04] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/114 places, 58/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/114 places, 58/158 transitions.
Product exploration explored 100000 steps with 33287 reset in 178 ms.
Product exploration explored 100000 steps with 33255 reset in 189 ms.
Built C files in :
/tmp/ltsmin17452766213339903411
[2022-05-15 17:44:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17452766213339903411
Running compilation step : cd /tmp/ltsmin17452766213339903411;'/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 246 ms.
Running link step : cd /tmp/ltsmin17452766213339903411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17452766213339903411;'/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/stateBased12429266090977746986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 158/158 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 158/158 (removed 0) transitions.
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:44:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:19] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:44:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2022-05-15 17:44:19] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 114 cols
[2022-05-15 17:44:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:44:19] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/114 places, 158/158 transitions.
Built C files in :
/tmp/ltsmin6758459932962259579
[2022-05-15 17:44:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6758459932962259579
Running compilation step : cd /tmp/ltsmin6758459932962259579;'/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 217 ms.
Running link step : cd /tmp/ltsmin6758459932962259579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6758459932962259579;'/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/stateBased11641252130792175463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 17:44:35] [INFO ] Flatten gal took : 9 ms
[2022-05-15 17:44:35] [INFO ] Flatten gal took : 9 ms
[2022-05-15 17:44:35] [INFO ] Time to serialize gal into /tmp/LTL9772544098157814423.gal : 3 ms
[2022-05-15 17:44:35] [INFO ] Time to serialize properties into /tmp/LTL10460979996968094375.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9772544098157814423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10460979996968094375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9772544...267
Read 1 LTL properties
Checking formula 0 : !((G(((X(((F(X("((p81==0)||(p59==1))")))||("(p53==0)"))||("(p40==1)")))||(X("((p144==0)&&(p97==1))")))||("((p59==0)&&(p81==1))"))))
Formula 0 simplified : !G("((p59==0)&&(p81==1))" | X("(p40==1)" | "(p53==0)" | FX"((p81==0)||(p59==1))") | X"((p144==0)&&(p97==1))")
Detected timeout of ITS tools.
[2022-05-15 17:44:50] [INFO ] Flatten gal took : 10 ms
[2022-05-15 17:44:50] [INFO ] Applying decomposition
[2022-05-15 17:44:50] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8602703776587354572.txt' '-o' '/tmp/graph8602703776587354572.bin' '-w' '/tmp/graph8602703776587354572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8602703776587354572.bin' '-l' '-1' '-v' '-w' '/tmp/graph8602703776587354572.weights' '-q' '0' '-e' '0.001'
[2022-05-15 17:44:50] [INFO ] Decomposing Gal with order
[2022-05-15 17:44:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 17:44:50] [INFO ] Removed a total of 84 redundant transitions.
[2022-05-15 17:44:50] [INFO ] Flatten gal took : 38 ms
[2022-05-15 17:44:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 7 ms.
[2022-05-15 17:44:50] [INFO ] Time to serialize gal into /tmp/LTL17768807357296553748.gal : 3 ms
[2022-05-15 17:44:50] [INFO ] Time to serialize properties into /tmp/LTL7707325022667256687.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17768807357296553748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7707325022667256687.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1776880...246
Read 1 LTL properties
Checking formula 0 : !((G(((X(((F(X("((i8.u17.p81==0)||(i5.u12.p59==1))")))||("(i5.u10.p53==0)"))||("(i3.u7.p40==1)")))||(X("((i14.u30.p144==0)&&(i9.u21.p9...208
Formula 0 simplified : !G("((i5.u12.p59==0)&&(i8.u17.p81==1))" | X("(i3.u7.p40==1)" | "(i5.u10.p53==0)" | FX"((i8.u17.p81==0)||(i5.u12.p59==1))") | X"((i14...188
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t47, t55, t56, t58, t60, t64, t66, t68, t70, i0.u0.t167, i1.u2.t168, i2.u4.t164, i3...475
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
228 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.30166,85688,1,0,129588,10465,1418,349573,251,79465,105419
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-15a-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DiscoveryGPU-PT-15a-LTLCardinality-13 finished in 53383 ms.
All properties solved by simple procedures.
Total runtime 63902 ms.

BK_STOP 1652636692980

--------------------
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-15a"
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-15a, 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-165260109900147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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