fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r078-tall-165260109700036
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DiscoveryGPU-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
249.859 6732.00 14124.00 121.50 FFFTTFFFFFTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109700036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109700036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 8.7K Apr 30 07:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 07:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 06:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 28K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652628923757

Running Version 202205111006
[2022-05-15 15:35:24] [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]
[2022-05-15 15:35:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:35:25] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-15 15:35:25] [INFO ] Transformed 83 places.
[2022-05-15 15:35:25] [INFO ] Transformed 113 transitions.
[2022-05-15 15:35:25] [INFO ] Found NUPN structural information;
[2022-05-15 15:35:25] [INFO ] Parsed PT model containing 83 places and 113 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 78 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 78 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 76 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 76 transition count 104
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 76 transition count 98
Applied a total of 20 rules in 20 ms. Remains 76 /83 variables (removed 7) and now considering 98/113 (removed 15) transitions.
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 15:35:25] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 15:35:25] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 15:35:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:35:25] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-05-15 15:35:25] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 15:35:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:25] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 76/83 places, 98/113 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/83 places, 98/113 transitions.
Support contains 27 out of 76 places after structural reductions.
[2022-05-15 15:35:25] [INFO ] Flatten gal took : 26 ms
[2022-05-15 15:35:25] [INFO ] Flatten gal took : 11 ms
[2022-05-15 15:35:25] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 15:35:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:35:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 15:35:26] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 217 edges and 76 vertex of which 71 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
FORMULA DiscoveryGPU-PT-08a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(p0))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Graph (complete) has 217 edges and 76 vertex of which 71 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 71 transition count 87
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 13 place count 65 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 60 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 60 transition count 82
Applied a total of 23 rules in 19 ms. Remains 60 /76 variables (removed 16) and now considering 82/98 (removed 16) transitions.
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:26] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:26] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:35:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:26] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 126 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/76 places, 82/98 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 45 transition count 68
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 40 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 40 transition count 58
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 35 transition count 48
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 35 transition count 48
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 30 transition count 43
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 30 transition count 43
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 25 transition count 33
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 25 transition count 33
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 20 transition count 28
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 20 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 79 place count 20 transition count 28
Applied a total of 79 rules in 13 ms. Remains 20 /59 variables (removed 39) and now considering 28/82 (removed 54) transitions.
[2022-05-15 15:35:26] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 20 cols
[2022-05-15 15:35:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:35:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-15 15:35:26] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 20 cols
[2022-05-15 15:35:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:35:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 15:35:26] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/76 places, 28/98 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/76 places, 28/98 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s8 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-00 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(X(p0))||X(p0)))'
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 65 transition count 87
Applied a total of 22 rules in 17 ms. Remains 65 /76 variables (removed 11) and now considering 87/98 (removed 11) transitions.
// Phase 1: matrix 87 rows 65 cols
[2022-05-15 15:35:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 87 rows 65 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:35:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/76 places, 87/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/76 places, 87/98 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-01 finished in 391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 66 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 63 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 63 transition count 85
Applied a total of 26 rules in 7 ms. Remains 63 /76 variables (removed 13) and now considering 85/98 (removed 13) transitions.
// Phase 1: matrix 85 rows 63 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 85 rows 63 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/76 places, 85/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/76 places, 85/98 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s3 1), p1:(OR (EQ s28 0) (EQ s61 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 214 steps with 2 reset in 7 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-02 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Graph (complete) has 217 edges and 76 vertex of which 71 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 71 transition count 87
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 65 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 60 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 60 transition count 82
Applied a total of 23 rules in 8 ms. Remains 60 /76 variables (removed 16) and now considering 82/98 (removed 16) transitions.
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-15 15:35:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:27] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/76 places, 82/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/76 places, 82/98 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s37 1) (EQ s59 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 70 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-05 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(p0)))&&X(F(X(G(((!p1 U p2)||p2)))))))'
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Graph (complete) has 217 edges and 76 vertex of which 71 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 71 transition count 87
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 65 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 60 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 60 transition count 82
Applied a total of 23 rules in 14 ms. Remains 60 /76 variables (removed 16) and now considering 82/98 (removed 16) transitions.
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-15 15:35:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:27] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/76 places, 82/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/76 places, 82/98 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s59 1)), p2:(AND (EQ s28 1) (EQ s58 1)), p1:(AND (EQ s19 1) (EQ s58 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 65 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-06 finished in 282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (p1 U !p2))))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 62 transition count 84
Applied a total of 28 rules in 5 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:28] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:28] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/76 places, 84/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s25 1) (EQ s61 1)), p1:(OR (NOT (AND (EQ s27 1) (EQ s60 1))) (AND (EQ s59 1) (EQ s60 1))), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-07 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 64 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 64 transition count 86
Applied a total of 24 rules in 9 ms. Remains 64 /76 variables (removed 12) and now considering 86/98 (removed 12) transitions.
// Phase 1: matrix 86 rows 64 cols
[2022-05-15 15:35:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:28] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 86 rows 64 cols
[2022-05-15 15:35:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-15 15:35:28] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/76 places, 86/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 86/98 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s46 1) (NEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 169 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-10 finished in 685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Graph (complete) has 217 edges and 76 vertex of which 71 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 71 transition count 87
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 65 transition count 87
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 60 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 60 transition count 82
Applied a total of 23 rules in 12 ms. Remains 60 /76 variables (removed 16) and now considering 82/98 (removed 16) transitions.
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:35:29] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 15:35:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-15 15:35:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 82 rows 60 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 15:35:29] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/76 places, 82/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/76 places, 82/98 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5623 steps with 266 reset in 16 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-11 finished in 285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Graph (complete) has 217 edges and 76 vertex of which 71 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 71 transition count 88
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 11 place count 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 62 transition count 84
Applied a total of 19 rules in 10 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:29] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-15 15:35:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-15 15:35:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:29] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/76 places, 84/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-12 automaton TGBA Formula[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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s61 1)), p1:(AND (EQ s37 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 157 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-12 finished in 306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1) U p0)||(G(p2) U G(!p3))||X(p2)))'
Support contains 6 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 72 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 72 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 68 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 65 transition count 87
Applied a total of 22 rules in 7 ms. Remains 65 /76 variables (removed 11) and now considering 87/98 (removed 11) transitions.
// Phase 1: matrix 87 rows 65 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:29] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 87 rows 65 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-15 15:35:29] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 87 rows 65 cols
[2022-05-15 15:35:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/76 places, 87/98 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/76 places, 87/98 transitions.
Stuttering acceptance computed with spot in 313 ms :[true, (AND (NOT p0) (NOT p2) p3), (AND p3 (NOT p2)), (AND (NOT p0) (NOT p2) p3), p3, (AND (NOT p0) p3), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=1 dest: 8}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 7}], [{ cond=p3, acceptance={} source=4 dest: 0}, { cond=(NOT p3), acceptance={} source=4 dest: 4}], [{ cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 7}]], initial=1, aps=[p3:(AND (EQ s5 1) (EQ s63 1)), p0:(AND (EQ s11 1) (EQ s64 1)), p1:(AND (EQ s21 1) (EQ s63 1)), p2:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-14 finished in 489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)&&p0) U G(!X(p2))))'
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 71 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 66 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 62 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 62 transition count 84
Applied a total of 28 rules in 3 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:35:30] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2022-05-15 15:35:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:35:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-15 15:35:30] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/76 places, 84/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 125 ms :[p2, (AND (NOT p1) p2), p2, true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (AND (EQ s56 1) (EQ s60 1)) (AND (EQ s26 1) (EQ s60 1))), p0:(AND (EQ s16 1) (EQ s60 1)), p1:(AND (NOT (AND (EQ s56 1) (EQ s60 1))) (NOT (AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-15 finished in 242 ms.
All properties solved by simple procedures.
Total runtime 5474 ms.

BK_STOP 1652628930489

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-08a"
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-08a, 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 r078-tall-165260109700036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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