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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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 2.9K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 50K 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-14a-00
FORMULA_NAME DiscoveryGPU-PT-14a-01
FORMULA_NAME DiscoveryGPU-PT-14a-02
FORMULA_NAME DiscoveryGPU-PT-14a-03
FORMULA_NAME DiscoveryGPU-PT-14a-04
FORMULA_NAME DiscoveryGPU-PT-14a-05
FORMULA_NAME DiscoveryGPU-PT-14a-06
FORMULA_NAME DiscoveryGPU-PT-14a-07
FORMULA_NAME DiscoveryGPU-PT-14a-08
FORMULA_NAME DiscoveryGPU-PT-14a-09
FORMULA_NAME DiscoveryGPU-PT-14a-10
FORMULA_NAME DiscoveryGPU-PT-14a-11
FORMULA_NAME DiscoveryGPU-PT-14a-12
FORMULA_NAME DiscoveryGPU-PT-14a-13
FORMULA_NAME DiscoveryGPU-PT-14a-14
FORMULA_NAME DiscoveryGPU-PT-14a-15

=== Now, execution of the tool begins

BK_START 1620580980538

Running Version 0
[2021-05-09 17:23:02] [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 17:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:23:02] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-09 17:23:02] [INFO ] Transformed 143 places.
[2021-05-09 17:23:02] [INFO ] Transformed 197 transitions.
[2021-05-09 17:23:02] [INFO ] Found NUPN structural information;
[2021-05-09 17:23:02] [INFO ] Parsed PT model containing 143 places and 197 transitions in 91 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 17:23:02] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-14a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 130 transition count 184
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 130 transition count 184
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 119 transition count 173
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 119 transition count 173
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 110 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 110 transition count 155
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 71 place count 110 transition count 150
Applied a total of 71 rules in 36 ms. Remains 110 /143 variables (removed 33) and now considering 150/197 (removed 47) transitions.
// Phase 1: matrix 150 rows 110 cols
[2021-05-09 17:23:02] [INFO ] Computed 2 place invariants in 12 ms
[2021-05-09 17:23:02] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 150 rows 110 cols
[2021-05-09 17:23:02] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:23:02] [INFO ] State equation strengthened by 101 read => feed constraints.
[2021-05-09 17:23:02] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
// Phase 1: matrix 150 rows 110 cols
[2021-05-09 17:23:02] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:23:02] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/143 places, 150/197 transitions.
[2021-05-09 17:23:02] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 17:23:02] [INFO ] Flatten gal took : 34 ms
FORMULA DiscoveryGPU-PT-14a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:23:02] [INFO ] Flatten gal took : 13 ms
[2021-05-09 17:23:02] [INFO ] Input system was already deterministic with 150 transitions.
Finished random walk after 11386 steps, including 73 resets, run visited all 27 properties in 58 ms. (steps per millisecond=196 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))&&F((X(G(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 144
Applied a total of 12 rules in 12 ms. Remains 104 /110 variables (removed 6) and now considering 144/150 (removed 6) transitions.
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:03] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:23:03] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:03] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:03] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/110 places, 144/150 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s32 0), p1:(AND (EQ s32 1) (EQ s103 1)), p2:(AND (EQ s32 1) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-14a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-01 finished in 537 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1&&F(p2))||G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 110 transition count 147
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 107 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 103 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 103 transition count 143
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 16 place count 102 transition count 142
Applied a total of 16 rules in 26 ms. Remains 102 /110 variables (removed 8) and now considering 142/150 (removed 8) transitions.
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:03] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:03] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 17:23:03] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:03] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163 ms to find 1 implicit places.
[2021-05-09 17:23:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 142 rows 101 cols
[2021-05-09 17:23:03] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:03] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 101/110 places, 142/150 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 52 place count 75 transition count 116
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 63 transition count 92
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 63 transition count 92
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 88 place count 51 transition count 68
Iterating global reduction 0 with 12 rules applied. Total rules applied 100 place count 51 transition count 68
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 39 transition count 56
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 39 transition count 56
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 135 place count 28 transition count 34
Iterating global reduction 0 with 11 rules applied. Total rules applied 146 place count 28 transition count 34
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 156 place count 18 transition count 24
Iterating global reduction 0 with 10 rules applied. Total rules applied 166 place count 18 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 167 place count 18 transition count 24
Applied a total of 167 rules in 19 ms. Remains 18 /101 variables (removed 83) and now considering 24/142 (removed 118) transitions.
[2021-05-09 17:23:03] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 17:23:03] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:23:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-09 17:23:03] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 17:23:03] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-09 17:23:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/110 places, 24/150 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14a-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s7 1), p1:(OR (NEQ s15 1) (NEQ s17 1)), p2:(AND (NEQ s13 0) (NEQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 97 ms.
[2021-05-09 17:23:04] [INFO ] Flatten gal took : 2 ms
[2021-05-09 17:23:04] [INFO ] Flatten gal took : 2 ms
[2021-05-09 17:23:04] [INFO ] Time to serialize gal into /tmp/LTL656766802394129736.gal : 1 ms
[2021-05-09 17:23:04] [INFO ] Time to serialize properties into /tmp/LTL11968322732337108823.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/LTL656766802394129736.gal, -t, CGAL, -LTL, /tmp/LTL11968322732337108823.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/LTL656766802394129736.gal -t CGAL -LTL /tmp/LTL11968322732337108823.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(p54==1)")||(G(F("((p90!=0)&&(p141!=0))"))))||((F("((p90!=0)&&(p141!=0))"))&&("((p99!=1)||(p141!=1))")))))
Formula 0 simplified : !F("(p54==1)" | GF"((p90!=0)&&(p141!=0))" | ("((p99!=1)||(p141!=1))" & F"((p90!=0)&&(p141!=0))"))
Reverse transition relation is NOT exact ! Due to transitions t43, t139, t142, t31.t126.t143, t105.t49, t104.t48, t94.t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/7/24
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
8 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,0.105663,18748,1,0,51,10981,80,28,630,14147,63
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-14a-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-14a-03 finished in 1320 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(p1 U X(p2))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 149
Applied a total of 2 rules in 8 ms. Remains 109 /110 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 109 cols
[2021-05-09 17:23:04] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:04] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 149 rows 109 cols
[2021-05-09 17:23:04] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:05] [INFO ] State equation strengthened by 101 read => feed constraints.
[2021-05-09 17:23:05] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 138 ms to find 1 implicit places.
// Phase 1: matrix 149 rows 108 cols
[2021-05-09 17:23:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 108/110 places, 149/150 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 149/149 (removed 0) transitions.
// Phase 1: matrix 149 rows 108 cols
[2021-05-09 17:23:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 108/110 places, 149/150 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(AND (EQ s18 1) (EQ s107 1)), p1:(OR (EQ s83 0) (EQ s107 0)), p3:(OR (EQ s85 1) (AND (EQ s76 1) (EQ s107 1))), p2:(AND (EQ s63 1) (EQ s107 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-04 finished in 477 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 110 transition count 147
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 107 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 103 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 103 transition count 143
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 16 place count 102 transition count 142
Applied a total of 16 rules in 13 ms. Remains 102 /110 variables (removed 8) and now considering 142/150 (removed 8) transitions.
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:05] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2021-05-09 17:23:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:05] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 17:23:05] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/110 places, 142/150 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s18 1), p0:(AND (EQ s34 1) (EQ s101 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 130 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-05 finished in 308 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 144
Applied a total of 12 rules in 4 ms. Remains 104 /110 variables (removed 6) and now considering 144/150 (removed 6) transitions.
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:05] [INFO ] Implicit Places using invariants and state equation in 92 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
// Phase 1: matrix 144 rows 103 cols
[2021-05-09 17:23:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:23:05] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 103/110 places, 144/150 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 103 cols
[2021-05-09 17:23:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:05] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 103/110 places, 144/150 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-06 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:(AND (EQ s35 1) (EQ s102 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-14a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-06 finished in 324 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(((p0 U p1)&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 110 transition count 147
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 107 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 103 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 103 transition count 143
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 16 place count 102 transition count 142
Applied a total of 16 rules in 10 ms. Remains 102 /110 variables (removed 8) and now considering 142/150 (removed 8) transitions.
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:06] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 136 ms to find 1 implicit places.
[2021-05-09 17:23:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 142 rows 101 cols
[2021-05-09 17:23:06] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:06] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 101/110 places, 142/150 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 52 place count 75 transition count 116
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 63 transition count 92
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 63 transition count 92
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 88 place count 51 transition count 68
Iterating global reduction 0 with 12 rules applied. Total rules applied 100 place count 51 transition count 68
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 39 transition count 56
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 39 transition count 56
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 135 place count 28 transition count 34
Iterating global reduction 0 with 11 rules applied. Total rules applied 146 place count 28 transition count 34
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 156 place count 18 transition count 24
Iterating global reduction 0 with 10 rules applied. Total rules applied 166 place count 18 transition count 24
Applied a total of 166 rules in 8 ms. Remains 18 /101 variables (removed 83) and now considering 24/142 (removed 118) transitions.
[2021-05-09 17:23:06] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 17:23:06] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-09 17:23:06] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 18 cols
[2021-05-09 17:23:06] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 17:23:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/110 places, 24/150 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14a-07 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1), p1:(AND (EQ s12 1) (EQ s17 1)), p2:(EQ s14 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-07 finished in 395 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 110 transition count 148
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 105 transition count 145
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 0 with 4 rules applied. Total rules applied 14 place count 103 transition count 143
Applied a total of 14 rules in 11 ms. Remains 103 /110 variables (removed 7) and now considering 143/150 (removed 7) transitions.
// Phase 1: matrix 143 rows 103 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 143 rows 103 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:06] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2021-05-09 17:23:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 143 rows 103 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 14 ms
[2021-05-09 17:23:06] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 103/110 places, 143/150 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-08 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 (NEQ s44 1) (NEQ s102 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 118 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-08 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X((p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 144
Applied a total of 12 rules in 2 ms. Remains 104 /110 variables (removed 6) and now considering 144/150 (removed 6) transitions.
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:06] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:06] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/110 places, 144/150 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14a-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s84 0) (EQ s102 0)), p2:(AND (EQ s79 1) (EQ s102 1)), p1:(OR (AND (EQ s79 1) (EQ s102 1) (EQ s20 1) (EQ s102 1)) (AND (EQ s36 1) (EQ s103 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 225 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-09 finished in 258 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((F(p0) U X(G(p1))) U p2) U X(p3)))], workingDir=/home/mcc/execution]
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 104 transition count 144
Applied a total of 12 rules in 2 ms. Remains 104 /110 variables (removed 6) and now considering 144/150 (removed 6) transitions.
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:06] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2021-05-09 17:23:06] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:23:07] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 132 ms to find 1 implicit places.
// Phase 1: matrix 144 rows 103 cols
[2021-05-09 17:23:07] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:23:07] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 103/110 places, 144/150 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 103 cols
[2021-05-09 17:23:07] [INFO ] Computed 1 place invariants in 16 ms
[2021-05-09 17:23:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 2 iterations. Remains : 103/110 places, 144/150 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s83 1) (EQ s102 1)), p0:(EQ s64 1), p3:(AND (EQ s32 1) (EQ s95 1)), p1:(AND (EQ s41 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2753 steps with 66 reset in 6 ms.
FORMULA DiscoveryGPU-PT-14a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-10 finished in 542 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 131 edges and 107 vertex of which 54 / 107 are part of one of the 27 SCC in 3 ms
Free SCC test removed 27 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 80 transition count 129
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 70 place count 60 transition count 102
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 50 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 50 transition count 82
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 100 place count 40 transition count 62
Iterating global reduction 2 with 10 rules applied. Total rules applied 110 place count 40 transition count 62
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 120 place count 30 transition count 42
Iterating global reduction 2 with 10 rules applied. Total rules applied 130 place count 30 transition count 42
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 140 place count 20 transition count 32
Iterating global reduction 2 with 10 rules applied. Total rules applied 150 place count 20 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 164 place count 13 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 166 place count 11 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 11 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 170 place count 9 transition count 15
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 174 place count 7 transition count 13
Iterating global reduction 2 with 2 rules applied. Total rules applied 176 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 5 transition count 10
Applied a total of 179 rules in 12 ms. Remains 5 /110 variables (removed 105) and now considering 10/150 (removed 140) transitions.
[2021-05-09 17:23:07] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 17:23:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 17:23:07] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 17:23:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2021-05-09 17:23:07] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:23:07] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2021-05-09 17:23:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/110 places, 10/150 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-14 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 150/150 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 110 transition count 147
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 107 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 103 transition count 143
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 103 transition count 143
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 16 place count 102 transition count 142
Applied a total of 16 rules in 12 ms. Remains 102 /110 variables (removed 8) and now considering 142/150 (removed 8) transitions.
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:23:07] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-09 17:23:07] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2021-05-09 17:23:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2021-05-09 17:23:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:23:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 102/110 places, 142/150 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-15 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s97 1) (EQ s101 1)), p0:(AND (EQ s15 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 22421 steps with 1034 reset in 48 ms.
FORMULA DiscoveryGPU-PT-14a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-15 finished in 353 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620580989098

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

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