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-162048875300333.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-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K 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 99K 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 24K 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.2K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 43K 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-12a-00
FORMULA_NAME DiscoveryGPU-PT-12a-01
FORMULA_NAME DiscoveryGPU-PT-12a-02
FORMULA_NAME DiscoveryGPU-PT-12a-03
FORMULA_NAME DiscoveryGPU-PT-12a-04
FORMULA_NAME DiscoveryGPU-PT-12a-05
FORMULA_NAME DiscoveryGPU-PT-12a-06
FORMULA_NAME DiscoveryGPU-PT-12a-07
FORMULA_NAME DiscoveryGPU-PT-12a-08
FORMULA_NAME DiscoveryGPU-PT-12a-09
FORMULA_NAME DiscoveryGPU-PT-12a-10
FORMULA_NAME DiscoveryGPU-PT-12a-11
FORMULA_NAME DiscoveryGPU-PT-12a-12
FORMULA_NAME DiscoveryGPU-PT-12a-13
FORMULA_NAME DiscoveryGPU-PT-12a-14
FORMULA_NAME DiscoveryGPU-PT-12a-15

=== Now, execution of the tool begins

BK_START 1620578822263

Running Version 0
[2021-05-09 16:47:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 16:47:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:47:05] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-09 16:47:05] [INFO ] Transformed 123 places.
[2021-05-09 16:47:05] [INFO ] Transformed 169 transitions.
[2021-05-09 16:47:05] [INFO ] Found NUPN structural information;
[2021-05-09 16:47:05] [INFO ] Parsed PT model containing 123 places and 169 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:47:05] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-12a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 115 transition count 161
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 115 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 109 transition count 155
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 109 transition count 155
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 103 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 103 transition count 143
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 103 transition count 137
Applied a total of 46 rules in 31 ms. Remains 103 /123 variables (removed 20) and now considering 137/169 (removed 32) transitions.
// Phase 1: matrix 137 rows 103 cols
[2021-05-09 16:47:05] [INFO ] Computed 2 place invariants in 12 ms
[2021-05-09 16:47:05] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 137 rows 103 cols
[2021-05-09 16:47:05] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 16:47:05] [INFO ] State equation strengthened by 90 read => feed constraints.
[2021-05-09 16:47:05] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 103 cols
[2021-05-09 16:47:05] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:47:05] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/123 places, 137/169 transitions.
[2021-05-09 16:47:06] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-09 16:47:06] [INFO ] Flatten gal took : 50 ms
FORMULA DiscoveryGPU-PT-12a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:47:06] [INFO ] Flatten gal took : 32 ms
[2021-05-09 16:47:06] [INFO ] Input system was already deterministic with 137 transitions.
Finished random walk after 473 steps, including 3 resets, run visited all 17 properties in 9 ms. (steps per millisecond=52 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 103 transition count 131
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 97 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 93 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 91 transition count 125
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 0 with 2 rules applied. Total rules applied 26 place count 90 transition count 124
Applied a total of 26 rules in 35 ms. Remains 90 /103 variables (removed 13) and now considering 124/137 (removed 13) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:47:06] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:47:06] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 16:47:06] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2021-05-09 16:47:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:06] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/103 places, 124/137 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s89 1)), p1:(AND (EQ s1 1) (OR (EQ s36 0) (EQ s89 0)))], nbAcceptance=2, 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 120 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-12a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-00 finished in 394 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 103 transition count 132
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 91 transition count 125
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 0 with 2 rules applied. Total rules applied 26 place count 90 transition count 124
Applied a total of 26 rules in 20 ms. Remains 90 /103 variables (removed 13) and now considering 124/137 (removed 13) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:06] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:47:06] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 16:47:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2021-05-09 16:47:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:06] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/103 places, 124/137 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s88 1)), p0:(AND (EQ s46 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-01 finished in 330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 91 transition count 125
Applied a total of 24 rules in 11 ms. Remains 91 /103 variables (removed 12) and now considering 125/137 (removed 12) transitions.
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:47:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:06] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:47:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:47:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
// Phase 1: matrix 125 rows 90 cols
[2021-05-09 16:47:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:47:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 90/103 places, 125/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 90 cols
[2021-05-09 16:47:07] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 16:47:07] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/103 places, 125/137 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s33 1) (EQ s89 1)), p1:(NEQ s53 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]]
Stuttering criterion allowed to conclude after 257 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-02 finished in 352 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 103 transition count 132
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 90 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 89 transition count 123
Applied a total of 28 rules in 17 ms. Remains 89 /103 variables (removed 14) and now considering 123/137 (removed 14) transitions.
// Phase 1: matrix 123 rows 89 cols
[2021-05-09 16:47:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:07] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 123 rows 89 cols
[2021-05-09 16:47:07] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:47:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:47:07] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2021-05-09 16:47:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 123 rows 89 cols
[2021-05-09 16:47:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:07] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 89/103 places, 123/137 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s11 1), p1:(OR (NEQ s58 1) (NEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1581 reset in 327 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA DiscoveryGPU-PT-12a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-03 finished in 617 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 94 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 91 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 91 transition count 125
Applied a total of 24 rules in 8 ms. Remains 91 /103 variables (removed 12) and now considering 125/137 (removed 12) transitions.
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:47:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:07] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:47:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:47:08] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:47:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:08] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/103 places, 125/137 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-04 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 (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s53 1) (EQ s90 1)), p0:(OR (NEQ s60 1) (NEQ s90 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-12a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-04 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 90 transition count 124
Applied a total of 26 rules in 10 ms. Remains 90 /103 variables (removed 13) and now considering 124/137 (removed 13) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:08] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:08] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 16:47:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:47:08] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 136 ms to find 1 implicit places.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:47:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:47:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 89/103 places, 124/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:47:08] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:47:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/103 places, 124/137 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-05 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s15 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-05 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 93 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 93 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 90 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 90 transition count 124
Applied a total of 26 rules in 3 ms. Remains 90 /103 variables (removed 13) and now considering 124/137 (removed 13) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:08] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:47:08] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:47:08] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 159 ms to find 1 implicit places.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:47:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:47:08] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 89/103 places, 124/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:47:08] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:47:08] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/103 places, 124/137 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s83 1) (AND (EQ s40 1) (EQ s88 1)) (AND (EQ s26 1) (EQ s88 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][false, false]]
Product exploration explored 100000 steps with 1957 reset in 201 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA DiscoveryGPU-PT-12a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-06 finished in 575 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 95 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 95 transition count 129
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 92 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 92 transition count 126
Applied a total of 22 rules in 5 ms. Remains 92 /103 variables (removed 11) and now considering 126/137 (removed 11) transitions.
// Phase 1: matrix 126 rows 92 cols
[2021-05-09 16:47:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:09] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 126 rows 92 cols
[2021-05-09 16:47:09] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:47:09] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 16:47:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 120 ms to find 1 implicit places.
// Phase 1: matrix 126 rows 91 cols
[2021-05-09 16:47:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:47:09] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 91/103 places, 126/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 91 cols
[2021-05-09 16:47:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:47:09] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 2 iterations. Remains : 91/103 places, 126/137 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ 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: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s60 1) (EQ s90 1)), p0:(NEQ s15 0)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-08 finished in 404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p0&&(p1 U (p2||G(p1))))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 99 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 95 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 95 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 93 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 93 transition count 127
Applied a total of 20 rules in 2 ms. Remains 93 /103 variables (removed 10) and now considering 127/137 (removed 10) transitions.
// Phase 1: matrix 127 rows 93 cols
[2021-05-09 16:47:09] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:47:09] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 127 rows 93 cols
[2021-05-09 16:47:09] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:47:09] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 16:47:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 128 ms to find 1 implicit places.
// Phase 1: matrix 127 rows 92 cols
[2021-05-09 16:47:09] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:47:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 92/103 places, 127/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 92 cols
[2021-05-09 16:47:09] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:47:09] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 92/103 places, 127/137 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-12a-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p3 p0 (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p3:(OR (NEQ s36 1) (AND (NEQ s36 1) (NEQ s18 0))), p0:(NEQ s53 0), p2:(AND (NEQ s36 1) (NEQ s18 0)), p1:(NEQ s36 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 798 reset in 289 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA DiscoveryGPU-PT-12a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-10 finished in 644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 119 edges and 100 vertex of which 48 / 100 are part of one of the 24 SCC in 3 ms
Free SCC test removed 24 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 76 transition count 112
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 75 place count 52 transition count 88
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 83 place count 44 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 91 place count 44 transition count 72
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 92 place count 44 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 43 transition count 71
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 102 place count 34 transition count 53
Iterating global reduction 4 with 9 rules applied. Total rules applied 111 place count 34 transition count 53
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 112 place count 34 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 113 place count 33 transition count 52
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 123 place count 23 transition count 32
Iterating global reduction 6 with 10 rules applied. Total rules applied 133 place count 23 transition count 32
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 143 place count 13 transition count 20
Iterating global reduction 6 with 10 rules applied. Total rules applied 153 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 155 place count 11 transition count 17
Iterating global reduction 6 with 2 rules applied. Total rules applied 157 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 10 transition count 16
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 163 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 164 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 166 place count 6 transition count 11
Applied a total of 166 rules in 15 ms. Remains 6 /103 variables (removed 97) and now considering 11/137 (removed 126) transitions.
[2021-05-09 16:47:10] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:47:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:47:10] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 16:47:10] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:47:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:47:10] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-09 16:47:10] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:47:10] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:47:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:47:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/103 places, 11/137 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-12 finished in 78 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620578831063

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-12a"
export BK_EXAMINATION="LTLFireability"
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-12a, examination is LTLFireability"
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-162048875300333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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