Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875300380.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
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 r083-tall-162048875300380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 53K May 5 16:51 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-00
FORMULA_NAME DiscoveryGPU-PT-15a-01
FORMULA_NAME DiscoveryGPU-PT-15a-02
FORMULA_NAME DiscoveryGPU-PT-15a-03
FORMULA_NAME DiscoveryGPU-PT-15a-04
FORMULA_NAME DiscoveryGPU-PT-15a-05
FORMULA_NAME DiscoveryGPU-PT-15a-06
FORMULA_NAME DiscoveryGPU-PT-15a-07
FORMULA_NAME DiscoveryGPU-PT-15a-08
FORMULA_NAME DiscoveryGPU-PT-15a-09
FORMULA_NAME DiscoveryGPU-PT-15a-10
FORMULA_NAME DiscoveryGPU-PT-15a-11
FORMULA_NAME DiscoveryGPU-PT-15a-12
FORMULA_NAME DiscoveryGPU-PT-15a-13
FORMULA_NAME DiscoveryGPU-PT-15a-14
FORMULA_NAME DiscoveryGPU-PT-15a-15

=== Now, execution of the tool begins

BK_START 1620582352671

Running Version 0
[2021-05-09 17:45:54] [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]
[2021-05-09 17:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:45:54] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-09 17:45:54] [INFO ] Transformed 153 places.
[2021-05-09 17:45:54] [INFO ] Transformed 211 transitions.
[2021-05-09 17:45:54] [INFO ] Found NUPN structural information;
[2021-05-09 17:45:54] [INFO ] Parsed PT model containing 153 places and 211 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 17:45:54] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-15a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 153 places. Attempting structural reductions.
Starting structural reductions, 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 136 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 136 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 130 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 130 transition count 182
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 130 transition count 173
Applied a total of 55 rules in 39 ms. Remains 130 /153 variables (removed 23) and now considering 173/211 (removed 38) transitions.
// Phase 1: matrix 173 rows 130 cols
[2021-05-09 17:45:54] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 17:45:54] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 173 rows 130 cols
[2021-05-09 17:45:54] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 17:45:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2021-05-09 17:45:54] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
// Phase 1: matrix 173 rows 129 cols
[2021-05-09 17:45:54] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:45:55] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 129/153 places, 173/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 173/173 (removed 0) transitions.
// Phase 1: matrix 173 rows 129 cols
[2021-05-09 17:45:55] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:45:55] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 129/153 places, 173/211 transitions.
[2021-05-09 17:45:55] [INFO ] Flatten gal took : 38 ms
[2021-05-09 17:45:55] [INFO ] Flatten gal took : 14 ms
[2021-05-09 17:45:55] [INFO ] Input system was already deterministic with 173 transitions.
Incomplete random walk after 100000 steps, including 614 resets, run finished after 397 ms. (steps per millisecond=251 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 173 rows 129 cols
[2021-05-09 17:45:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 17:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:45:55] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-09 17:45:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 17:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:45:56] [INFO ] [Nat]Absence check using state equation in 29 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-05-09 17:45:56] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-15a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 146 edges and 127 vertex of which 58 / 127 are part of one of the 29 SCC in 15 ms
Free SCC test removed 29 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 98 transition count 139
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 97 place count 65 transition count 110
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 55 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 55 transition count 90
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 126 place count 46 transition count 72
Iterating global reduction 2 with 9 rules applied. Total rules applied 135 place count 46 transition count 72
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 144 place count 37 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 153 place count 37 transition count 54
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 162 place count 28 transition count 45
Iterating global reduction 2 with 9 rules applied. Total rules applied 171 place count 28 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 185 place count 21 transition count 38
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 189 place count 17 transition count 30
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 17 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 14 transition count 21
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 14 transition count 21
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 11 transition count 18
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 11 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 9 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 8 transition count 14
Applied a total of 209 rules in 44 ms. Remains 8 /129 variables (removed 121) and now considering 14/173 (removed 159) transitions.
[2021-05-09 17:45:56] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 17:45:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:45:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 17:45:56] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 17:45:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:45:56] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 17:45:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:45:56] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 17:45:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:45:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/129 places, 14/173 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s6 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 20 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-00 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 117 transition count 161
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 117 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 113 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 113 transition count 157
Applied a total of 32 rules in 8 ms. Remains 113 /129 variables (removed 16) and now considering 157/173 (removed 16) transitions.
// Phase 1: matrix 157 rows 113 cols
[2021-05-09 17:45:56] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-09 17:45:56] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 157 rows 113 cols
[2021-05-09 17:45:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:56] [INFO ] State equation strengthened by 77 read => feed constraints.
[2021-05-09 17:45:56] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 113 cols
[2021-05-09 17:45:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/129 places, 157/173 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (NEQ s56 0) (NEQ s106 1) (OR (NEQ s88 0) (NEQ s32 1))), p0:(AND (NEQ s53 0) (NEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-02 finished in 506 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 115 transition count 159
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 115 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 110 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 110 transition count 154
Applied a total of 38 rules in 8 ms. Remains 110 /129 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:45:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:56] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:45:56] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 17:45:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2021-05-09 17:45:57] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:45:57] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:45:57] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/129 places, 154/173 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-15a-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(NEQ s77 1), p1:(OR (EQ s62 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-04 finished in 1173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 115 transition count 159
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 115 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 110 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 110 transition count 154
Applied a total of 38 rules in 7 ms. Remains 110 /129 variables (removed 19) and now considering 154/173 (removed 19) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:58] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 17:45:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2021-05-09 17:45:58] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 17:45:58] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/129 places, 154/173 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-05 automaton TGBA [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:(NEQ s101 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-05 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 117 transition count 161
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 117 transition count 161
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 113 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 113 transition count 157
Applied a total of 32 rules in 5 ms. Remains 113 /129 variables (removed 16) and now considering 157/173 (removed 16) transitions.
// Phase 1: matrix 157 rows 113 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:45:58] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 157 rows 113 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 17:45:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2021-05-09 17:45:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 113 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:58] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/129 places, 157/173 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-15a-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (NEQ s60 0) (NEQ s28 1)), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-08 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(((F(p1) U p2)||p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 122 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 122 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 116 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 116 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 111 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 111 transition count 155
Applied a total of 36 rules in 3 ms. Remains 111 /129 variables (removed 18) and now considering 155/173 (removed 18) transitions.
// Phase 1: matrix 155 rows 111 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 17:45:58] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 155 rows 111 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:45:58] [INFO ] State equation strengthened by 76 read => feed constraints.
[2021-05-09 17:45:58] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 111 cols
[2021-05-09 17:45:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:45:59] [INFO ] Dead Transitions using invariants and state equation in 665 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/129 places, 155/173 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15a-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s25 0) (EQ s72 1)), p2:(AND (EQ s82 0) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 430 ms.
Product exploration explored 100000 steps with 33333 reset in 254 ms.
Graph (complete) has 307 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 211 ms.
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 111 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 111/111 places, 155/155 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 111 transition count 181
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 99 transition count 157
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 99 transition count 157
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 75 transition count 109
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 75 transition count 109
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 63 transition count 97
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 63 transition count 97
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 134 place count 53 transition count 77
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 144 place count 53 transition count 77
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 164 place count 33 transition count 47
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 184 place count 33 transition count 47
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 184 rules in 18 ms. Remains 33 /111 variables (removed 78) and now considering 47/155 (removed 108) transitions.
[2021-05-09 17:46:01] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:46:01] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
// Phase 1: matrix 44 rows 33 cols
[2021-05-09 17:46:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:46:01] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/111 places, 47/155 transitions.
Product exploration explored 100000 steps with 33333 reset in 367 ms.
Product exploration explored 100000 steps with 33333 reset in 399 ms.
Starting structural reductions, iteration 0 : 111/111 places, 155/155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 154
Applied a total of 2 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:46:01] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:01] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 17:46:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2021-05-09 17:46:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 110 cols
[2021-05-09 17:46:02] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 17:46:02] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/111 places, 154/155 transitions.
[2021-05-09 17:46:02] [INFO ] Flatten gal took : 14 ms
[2021-05-09 17:46:02] [INFO ] Flatten gal took : 9 ms
[2021-05-09 17:46:02] [INFO ] Time to serialize gal into /tmp/LTL9497764093371507075.gal : 5 ms
[2021-05-09 17:46:02] [INFO ] Time to serialize properties into /tmp/LTL8555681065435321293.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9497764093371507075.gal, -t, CGAL, -LTL, /tmp/LTL8555681065435321293.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9497764093371507075.gal -t CGAL -LTL /tmp/LTL8555681065435321293.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(F(("((p33==0)||(p98==1))")||((F("((p101!=0)&&(p51!=1))"))U("((p114==0)&&(p128==1))")))))))
Formula 0 simplified : !XXF("((p33==0)||(p98==1))" | (F"((p101!=0)&&(p51!=1))" U "((p114==0)&&(p128==1))"))
Detected timeout of ITS tools.
[2021-05-09 17:46:17] [INFO ] Flatten gal took : 8 ms
[2021-05-09 17:46:17] [INFO ] Applying decomposition
[2021-05-09 17:46:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7424612572017702923.txt, -o, /tmp/graph7424612572017702923.bin, -w, /tmp/graph7424612572017702923.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7424612572017702923.bin, -l, -1, -v, -w, /tmp/graph7424612572017702923.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 17:46:17] [INFO ] Decomposing Gal with order
[2021-05-09 17:46:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 17:46:17] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-09 17:46:17] [INFO ] Flatten gal took : 38 ms
[2021-05-09 17:46:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 7 ms.
[2021-05-09 17:46:17] [INFO ] Time to serialize gal into /tmp/LTL2311963463688849703.gal : 4 ms
[2021-05-09 17:46:17] [INFO ] Time to serialize properties into /tmp/LTL14938576396023060507.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2311963463688849703.gal, -t, CGAL, -LTL, /tmp/LTL14938576396023060507.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2311963463688849703.gal -t CGAL -LTL /tmp/LTL14938576396023060507.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((X(X(F(("((i4.u6.p33==0)||(u23.p98==1))")||((F("((i12.u24.p101!=0)&&(i7.u11.p51!=1))"))U("((i0.u27.p114==0)&&(i14.u31.p128==1))")))))))
Formula 0 simplified : !XXF("((i4.u6.p33==0)||(u23.p98==1))" | (F"((i12.u24.p101!=0)&&(i7.u11.p51!=1))" U "((i0.u27.p114==0)&&(i14.u31.p128==1))"))
Reverse transition relation is NOT exact ! Due to transitions t37, t131, t142, u1.t164, i0.t68, i0.t66, i0.t62, i0.t56, i0.t53, i0.t51, i0.u0.t54, i0.u2.t165, i0.u4.t162, i0.u9.t161, i0.u17.t169, i0.u27.t171, i0.u32.t172, i0.u37.t163, i4.u6.t14, i4.u6.t30, i4.u7.t166, i4.u22.t170, i7.u11.t167, i7.u12.t168, i8.u14.t160, i8.u15.t159, i10.u19.t158, i10.u20.t157, i12.u24.t156, i12.u25.t155, i14.u29.t154, i14.u30.t153, i16.u35.t152, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/99/33/132
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
701 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,7.02672,197236,1,0,337141,2116,1317,1.12146e+06,202,11493,311855
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-15a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(((u1.p9==0)&&(i8.u14.p61==1))&&((i10.u19.p81==0)||(i12.u26.p109==1)))"))))
Formula 1 simplified : !FG"(((u1.p9==0)&&(i8.u14.p61==1))&&((i10.u19.p81==0)||(i12.u26.p109==1)))"
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12453432747322454282
[2021-05-09 17:46:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12453432747322454282
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12453432747322454282]
Compilation finished in 721 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12453432747322454282]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin12453432747322454282]
LTSmin run took 765 ms.
FORMULA DiscoveryGPU-PT-15a-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp1==true)||(<>((LTLAPp2==true)) U (LTLAPp3==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12453432747322454282]
LTSmin run took 270 ms.
FORMULA DiscoveryGPU-PT-15a-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((LTLAPp4==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin12453432747322454282]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DiscoveryGPU-PT-15a-09 finished in 48821 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 143 edges and 127 vertex of which 58 / 127 are part of one of the 29 SCC in 0 ms
Free SCC test removed 29 places
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 98 transition count 143
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 91 place count 69 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 67 transition count 112
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 102 place count 58 transition count 94
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 58 transition count 94
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 58 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 57 transition count 93
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 122 place count 48 transition count 75
Iterating global reduction 5 with 9 rules applied. Total rules applied 131 place count 48 transition count 75
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 140 place count 39 transition count 57
Iterating global reduction 5 with 9 rules applied. Total rules applied 149 place count 39 transition count 57
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 158 place count 30 transition count 48
Iterating global reduction 5 with 9 rules applied. Total rules applied 167 place count 30 transition count 48
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 183 place count 22 transition count 40
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 20 transition count 36
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 20 transition count 36
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 189 place count 18 transition count 30
Iterating global reduction 5 with 2 rules applied. Total rules applied 191 place count 18 transition count 30
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 193 place count 16 transition count 28
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 16 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 16 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 15 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 14 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 13 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 12 transition count 23
Applied a total of 200 rules in 13 ms. Remains 12 /129 variables (removed 117) and now considering 23/173 (removed 150) transitions.
[2021-05-09 17:46:47] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 17:46:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:47] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-09 17:46:47] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 17:46:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:46:47] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 17:46:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:46:47] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-09 17:46:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:47] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/129 places, 23/173 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s9 0) (EQ s2 1) (EQ s5 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 617 steps with 12 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-13 finished in 111 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 173/173 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 146 edges and 127 vertex of which 58 / 127 are part of one of the 29 SCC in 0 ms
Free SCC test removed 29 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 98 transition count 139
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 97 place count 65 transition count 110
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 108 place count 54 transition count 88
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 54 transition count 88
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 1 rules applied. Total rules applied 120 place count 54 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 53 transition count 87
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 133 place count 41 transition count 63
Iterating global reduction 4 with 12 rules applied. Total rules applied 145 place count 41 transition count 63
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 41 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 40 transition count 62
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 158 place count 29 transition count 40
Iterating global reduction 6 with 11 rules applied. Total rules applied 169 place count 29 transition count 40
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 29 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 171 place count 28 transition count 39
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 183 place count 16 transition count 24
Iterating global reduction 8 with 12 rules applied. Total rules applied 195 place count 16 transition count 24
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 198 place count 13 transition count 19
Iterating global reduction 8 with 3 rules applied. Total rules applied 201 place count 13 transition count 19
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 203 place count 11 transition count 16
Iterating global reduction 8 with 2 rules applied. Total rules applied 205 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 206 place count 10 transition count 15
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 10 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 209 place count 9 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 211 place count 9 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 212 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 213 place count 8 transition count 13
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 216 place count 6 transition count 11
Applied a total of 216 rules in 17 ms. Remains 6 /129 variables (removed 123) and now considering 11/173 (removed 162) transitions.
[2021-05-09 17:46:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2021-05-09 17:46:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:47] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 17:46:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2021-05-09 17:46:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:46:47] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-09 17:46:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:46:47] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2021-05-09 17:46:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:46:47] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/129 places, 11/173 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s4 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-15a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-14 finished in 89 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620582408473

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r083-tall-162048875300380"
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 ;