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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-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 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:59 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 28K 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-08a-00
FORMULA_NAME DiscoveryGPU-PT-08a-01
FORMULA_NAME DiscoveryGPU-PT-08a-02
FORMULA_NAME DiscoveryGPU-PT-08a-03
FORMULA_NAME DiscoveryGPU-PT-08a-04
FORMULA_NAME DiscoveryGPU-PT-08a-05
FORMULA_NAME DiscoveryGPU-PT-08a-06
FORMULA_NAME DiscoveryGPU-PT-08a-07
FORMULA_NAME DiscoveryGPU-PT-08a-08
FORMULA_NAME DiscoveryGPU-PT-08a-09
FORMULA_NAME DiscoveryGPU-PT-08a-10
FORMULA_NAME DiscoveryGPU-PT-08a-11
FORMULA_NAME DiscoveryGPU-PT-08a-12
FORMULA_NAME DiscoveryGPU-PT-08a-13
FORMULA_NAME DiscoveryGPU-PT-08a-14
FORMULA_NAME DiscoveryGPU-PT-08a-15

=== Now, execution of the tool begins

BK_START 1620573680270

Running Version 0
[2021-05-09 15:21:21] [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 15:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:21:21] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-09 15:21:21] [INFO ] Transformed 83 places.
[2021-05-09 15:21:21] [INFO ] Transformed 113 transitions.
[2021-05-09 15:21:21] [INFO ] Found NUPN structural information;
[2021-05-09 15:21:21] [INFO ] Parsed PT model containing 83 places and 113 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:21:21] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-08a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 108
Iterating global reduction 0 with 5 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 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 76 transition count 106
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 22 place count 76 transition count 98
Applied a total of 22 rules in 32 ms. Remains 76 /83 variables (removed 7) and now considering 98/113 (removed 15) transitions.
// Phase 1: matrix 98 rows 76 cols
[2021-05-09 15:21:22] [INFO ] Computed 2 place invariants in 13 ms
[2021-05-09 15:21:22] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 98 rows 76 cols
[2021-05-09 15:21:22] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:21:22] [INFO ] State equation strengthened by 62 read => feed constraints.
[2021-05-09 15:21:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 76 cols
[2021-05-09 15:21:22] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:21:22] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/83 places, 98/113 transitions.
[2021-05-09 15:21:22] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-09 15:21:22] [INFO ] Flatten gal took : 31 ms
FORMULA DiscoveryGPU-PT-08a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:21:22] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:21:22] [INFO ] Input system was already deterministic with 98 transitions.
Finished random walk after 355 steps, including 4 resets, run visited all 22 properties in 8 ms. (steps per millisecond=44 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 73 vertex of which 32 / 73 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 57 transition count 76
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 61 place count 36 transition count 60
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 32 transition count 52
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 32 transition count 52
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 32 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 31 transition count 51
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 26 transition count 41
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 26 transition count 41
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 83 place count 25 transition count 40
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 89 place count 19 transition count 28
Iterating global reduction 6 with 6 rules applied. Total rules applied 95 place count 19 transition count 28
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 101 place count 13 transition count 20
Iterating global reduction 6 with 6 rules applied. Total rules applied 107 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 109 place count 11 transition count 17
Iterating global reduction 6 with 2 rules applied. Total rules applied 111 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 112 place count 10 transition count 16
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 117 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 120 place count 6 transition count 11
Applied a total of 120 rules in 24 ms. Remains 6 /76 variables (removed 70) and now considering 11/98 (removed 87) transitions.
[2021-05-09 15:21:22] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:21:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2021-05-09 15:21:22] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:21:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:21:22] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-09 15:21:22] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:21:22] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:21:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:21:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/76 places, 11/98 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-01 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-08a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-01 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(X(X(F(p1))) U (F(!p1)&&p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 64 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 64 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 62 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 62 transition count 84
Applied a total of 28 rules in 6 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:21:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 62/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), p1, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-02 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 4}, { cond=p2, acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s36 1), p2:(AND (EQ s18 1) (EQ s61 1)), p1:(OR (NEQ s20 1) (NEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-02 finished in 393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, 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 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 68 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 68 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 67 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 67 transition count 89
Applied a total of 18 rules in 6 ms. Remains 67 /76 variables (removed 9) and now considering 89/98 (removed 9) transitions.
// Phase 1: matrix 89 rows 67 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 89 rows 67 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98 ms to find 1 implicit places.
// Phase 1: matrix 89 rows 66 cols
[2021-05-09 15:21:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 66/76 places, 89/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 66 cols
[2021-05-09 15:21:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/76 places, 89/98 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s55 0) (OR (EQ s18 0) (EQ s65 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 148 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-03 finished in 279 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 64 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 64 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 62 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 62 transition count 84
Applied a total of 28 rules in 6 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 61/76 places, 84/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s29 1), p1:(AND (EQ s42 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-04 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 64 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 64 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 62 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 62 transition count 84
Applied a total of 28 rules in 6 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:23] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:24] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:24] [INFO ] Computed 1 place invariants in 13 ms
[2021-05-09 15:21:24] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:24] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:21:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 80 ms :[(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-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s32 1), p1:(AND (EQ s12 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-06 finished in 272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(X(p1) U ((p2&&X(p1))||X(G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 64 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 64 transition count 86
Applied a total of 24 rules in 3 ms. Remains 64 /76 variables (removed 12) and now considering 86/98 (removed 12) transitions.
// Phase 1: matrix 86 rows 64 cols
[2021-05-09 15:21:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:24] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 86 rows 64 cols
[2021-05-09 15:21:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:24] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 86 rows 64 cols
[2021-05-09 15:21:24] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 15:21:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/76 places, 86/98 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s26 1) (NEQ s63 1)), p2:(OR (NEQ s12 1) (NEQ s63 1)), p1:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33140 reset in 304 ms.
Product exploration explored 100000 steps with 33259 reset in 221 ms.
Graph (complete) has 197 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33378 reset in 183 ms.
Product exploration explored 100000 steps with 33402 reset in 173 ms.
[2021-05-09 15:21:25] [INFO ] Flatten gal took : 13 ms
[2021-05-09 15:21:25] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:21:25] [INFO ] Time to serialize gal into /tmp/LTL16061066802769022097.gal : 2 ms
[2021-05-09 15:21:25] [INFO ] Time to serialize properties into /tmp/LTL6028650107380235549.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16061066802769022097.gal, -t, CGAL, -LTL, /tmp/LTL6028650107380235549.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/LTL16061066802769022097.gal -t CGAL -LTL /tmp/LTL6028650107380235549.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(((X("(p3!=1)"))U((("((p14!=1)||(p82!=1))")&&(X("(p3!=1)")))||(X(G("(p3!=1)")))))&&("((p33!=1)||(p82!=1))")))))
Formula 0 simplified : !GF("((p33!=1)||(p82!=1))" & (X"(p3!=1)" U (("((p14!=1)||(p82!=1))" & X"(p3!=1)") | XG"(p3!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t13, t19, t22, t26, t28, t32, t35, t37, t39, t87, t89, t90, t91, t93, t94, t95, t96, t97, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/68/18/86
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
140 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,1.41772,54640,1,0,147,193829,218,99,2074,234125,251
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-08a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-08a-07 finished in 3190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(p0) U (G(p0)&&p1)))||((p2 U X(p3))&&F(p4))))], workingDir=/home/mcc/execution]
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 63 transition count 85
Applied a total of 26 rules in 3 ms. Remains 63 /76 variables (removed 13) and now considering 85/98 (removed 13) transitions.
// Phase 1: matrix 85 rows 63 cols
[2021-05-09 15:21:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:27] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 85 rows 63 cols
[2021-05-09 15:21:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 85 rows 63 cols
[2021-05-09 15:21:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:27] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 63/76 places, 85/98 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p4), (AND (NOT p4) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-08 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p4), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p3) p1 p0), acceptance={0} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={0} source=1 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p4) (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p4) (NOT p0)), acceptance={0} source=3 dest: 11}, { cond=(AND (NOT p4) p1 p0), acceptance={0} source=3 dest: 12}], [{ cond=(NOT p3), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=10 dest: 8}, { cond=(AND p1 p0), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}], [{ cond=(NOT p4), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p4) p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(EQ s11 1), p4:(OR (NEQ s29 1) (NEQ s62 1)), p3:(EQ s22 1), p1:(AND (EQ s29 1) (EQ s62 1)), p0:(NEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 159 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-08 finished in 549 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 76 transition count 93
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 71 transition count 93
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 17 place count 64 transition count 86
Iterating global reduction 0 with 7 rules applied. Total rules applied 24 place count 64 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 62 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 62 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 61 transition count 83
Applied a total of 30 rules in 11 ms. Remains 61 /76 variables (removed 15) and now considering 83/98 (removed 15) transitions.
// Phase 1: matrix 83 rows 61 cols
[2021-05-09 15:21:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 83 rows 61 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2021-05-09 15:21:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 83 rows 61 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:21:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/76 places, 83/98 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-10 automaton TGBA [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:(OR (AND (EQ s19 1) (EQ s59 1)) (AND (EQ s37 1) (EQ s60 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 76204 steps with 2188 reset in 107 ms.
FORMULA DiscoveryGPU-PT-08a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-10 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 64 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 64 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 62 transition count 84
Iterating global reduction 0 with 2 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
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:28] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-09 15:21:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 61/76 places, 84/98 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/76 places, 84/98 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s53 1), p1:(OR (AND (NEQ s19 0) (NEQ s60 0)) (NEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-11 finished in 314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 70 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 66 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 66 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 64 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 64 transition count 86
Applied a total of 24 rules in 2 ms. Remains 64 /76 variables (removed 12) and now considering 86/98 (removed 12) transitions.
// Phase 1: matrix 86 rows 64 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 86 rows 64 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 15:21:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 85 ms to find 1 implicit places.
// Phase 1: matrix 86 rows 63 cols
[2021-05-09 15:21:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 63/76 places, 86/98 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 63 cols
[2021-05-09 15:21:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:21:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/76 places, 86/98 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (NEQ s34 1) (OR (NEQ s32 1) (NEQ s62 1)) (OR (NEQ s32 1) (NEQ s62 1))), p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-12 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 76/76 places, 98/98 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 76 transition count 93
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 71 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 16 place count 65 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 63 transition count 85
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 28 place count 62 transition count 84
Applied a total of 28 rules in 9 ms. Remains 62 /76 variables (removed 14) and now considering 84/98 (removed 14) transitions.
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 84 rows 62 cols
[2021-05-09 15:21:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:21:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2021-05-09 15:21:28] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
[2021-05-09 15:21:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 61 cols
[2021-05-09 15:21:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 61/76 places, 84/98 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 45 transition count 68
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 39 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 39 transition count 56
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 33 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 33 transition count 44
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 27 transition count 38
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 27 transition count 38
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 21 transition count 26
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 21 transition count 26
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 86 place count 15 transition count 20
Iterating global reduction 0 with 6 rules applied. Total rules applied 92 place count 15 transition count 20
Applied a total of 92 rules in 5 ms. Remains 15 /61 variables (removed 46) and now considering 20/84 (removed 64) transitions.
[2021-05-09 15:21:28] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 15:21:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:21:29] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-09 15:21:29] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 15:21:29] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 15:21:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 15:21:29] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/76 places, 20/98 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-14 automaton TGBA [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 s7 1) (EQ s14 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 0 ms.
FORMULA DiscoveryGPU-PT-08a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-14 finished in 244 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620573689980

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