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.r168-tall-165277016100052.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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 29K Apr 30 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 30 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 30 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 30 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.8K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 100K May 10 09:34 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 Peterson-PT-2-LTLFireability-00
FORMULA_NAME Peterson-PT-2-LTLFireability-01
FORMULA_NAME Peterson-PT-2-LTLFireability-02
FORMULA_NAME Peterson-PT-2-LTLFireability-03
FORMULA_NAME Peterson-PT-2-LTLFireability-04
FORMULA_NAME Peterson-PT-2-LTLFireability-05
FORMULA_NAME Peterson-PT-2-LTLFireability-06
FORMULA_NAME Peterson-PT-2-LTLFireability-07
FORMULA_NAME Peterson-PT-2-LTLFireability-08
FORMULA_NAME Peterson-PT-2-LTLFireability-09
FORMULA_NAME Peterson-PT-2-LTLFireability-10
FORMULA_NAME Peterson-PT-2-LTLFireability-11
FORMULA_NAME Peterson-PT-2-LTLFireability-12
FORMULA_NAME Peterson-PT-2-LTLFireability-13
FORMULA_NAME Peterson-PT-2-LTLFireability-14
FORMULA_NAME Peterson-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652779196678

Running Version 202205111006
[2022-05-17 09:19:57] [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-17 09:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:19:57] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-17 09:19:57] [INFO ] Transformed 102 places.
[2022-05-17 09:19:57] [INFO ] Transformed 126 transitions.
[2022-05-17 09:19:57] [INFO ] Found NUPN structural information;
[2022-05-17 09:19:57] [INFO ] Parsed PT model containing 102 places and 126 transitions in 177 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 Peterson-PT-2-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:19:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:19:58] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-17 09:19:58] [INFO ] Implicit Places using invariants in 145 ms returned []
[2022-05-17 09:19:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:19:58] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-17 09:19:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:19:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2022-05-17 09:19:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:19:58] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:19:58] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Support contains 95 out of 102 places after structural reductions.
[2022-05-17 09:19:58] [INFO ] Flatten gal took : 29 ms
[2022-05-17 09:19:58] [INFO ] Flatten gal took : 14 ms
[2022-05-17 09:19:58] [INFO ] Input system was already deterministic with 126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-17 09:19:59] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:19:59] [INFO ] Computed 11 place invariants in 13 ms
[2022-05-17 09:19:59] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 09:19:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 09:19:59] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 09:19:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-05-17 09:19:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 09:19:59] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 09:19:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:19:59] [INFO ] After 21ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 09:19:59] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 6 ms to minimize.
[2022-05-17 09:19:59] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 2 ms to minimize.
[2022-05-17 09:19:59] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2022-05-17 09:19:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2022-05-17 09:19:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 229 ms
[2022-05-17 09:19:59] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2022-05-17 09:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-17 09:19:59] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 09:19:59] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 10 out of 102 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 102 transition count 100
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 76 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 74 transition count 98
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 56 place count 74 transition count 78
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 33 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/102 places, 78/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 09:20:00] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 54 cols
[2022-05-17 09:20:00] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:20:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 09:20:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 09:20:00] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-17 09:20:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:20:00] [INFO ] After 5ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 09:20:00] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 09:20:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 09:20:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 09:20:00] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 09:20:00] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 152 ms
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 5 ms to minimize.
[2022-05-17 09:20:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2022-05-17 09:20:00] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 09:20:00] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 54/54 places, 78/78 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 52 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 52 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 50 transition count 74
Applied a total of 8 rules in 14 ms. Remains 50 /54 variables (removed 4) and now considering 74/78 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/54 places, 74/78 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1726 steps, run visited all 2 properties in 19 ms. (steps per millisecond=90 )
Probabilistic random walk after 1726 steps, saw 436 distinct states, run finished after 19 ms. (steps per millisecond=90 ) properties seen :2
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))&&X(p1)))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:01] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:20:01] [INFO ] Implicit Places using invariants in 92 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s21 1) (EQ s22 1) (EQ s24 1)), p0:(AND (OR (EQ s66 0) (EQ s86 0)) (OR (EQ s61 0) (EQ s87 0)) (OR (EQ s65 0) (EQ s88 0)) (OR (EQ s67 0) (EQ s89 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 Peterson-PT-2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-00 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F((!p0 U p0)))&&p1))))'
Support contains 24 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 102 transition count 110
Reduce places removed 16 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 28 rules applied. Total rules applied 44 place count 86 transition count 98
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 56 place count 74 transition count 98
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 56 place count 74 transition count 89
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 74 place count 65 transition count 89
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 61 transition count 85
Applied a total of 82 rules in 18 ms. Remains 61 /102 variables (removed 41) and now considering 85/126 (removed 41) transitions.
[2022-05-17 09:20:01] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
// Phase 1: matrix 79 rows 61 cols
[2022-05-17 09:20:01] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:20:01] [INFO ] Implicit Places using invariants in 37 ms returned [47, 49, 50]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/102 places, 85/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/102 places, 85/126 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-01 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s48 1) (EQ s56 1)) (AND (EQ s48 1) (EQ s57 1)) (AND (EQ s46 1) (EQ s56 1)) (AND (EQ s46 1) (EQ s57 1)) (AND (EQ s47 1) (EQ s53 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14959 reset in 300 ms.
Stack based approach found an accepted trace after 48 steps with 5 reset with depth 25 and stack size 24 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-01 finished in 463 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(F(p1))&&X(p1)&&p0)))&&X(p2)))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:01] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-17 09:20:01] [INFO ] Implicit Places using invariants in 52 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (OR (EQ s42 0) (EQ s60 0)) (OR (EQ s44 0) (EQ s52 0)) (OR (EQ s42 0) (EQ s58 0)) (OR (EQ s42 0) (EQ s59 0)) (OR (EQ s41 0) (EQ s56 0)) (OR (EQ s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-02 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((F(p0)&&p1)))||p2)))'
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:02] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:20:02] [INFO ] Implicit Places using invariants in 45 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p2:(AND (OR (EQ s86 0) (EQ s96 0)) (OR (EQ s86 0) (EQ s97 0)) (OR (EQ s79 0) (EQ s96 0)) (OR (EQ s79 0) (EQ s97 0)) (OR (EQ s85 0) (EQ s93 0)) (OR (EQ s88...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-03 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F((G((!p1 U p2))&&X(p1)))||p0)))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:02] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-05-17 09:20:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:20:02] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-05-17 09:20:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(OR p2 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (EQ s47 1) (EQ s88 1)) (AND (EQ s46 1) (EQ s87 1)) (AND (EQ s48 1) (EQ s85 1))), p2:(OR (AND (EQ s89 1) (EQ s99 1)) (AND (EQ s89 1) (EQ s100 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4914 reset in 296 ms.
Stack based approach found an accepted trace after 189 steps with 11 reset with depth 16 and stack size 16 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-04 finished in 792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)||p0))&&F((G(p1)&&p1))))'
Support contains 12 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 72 place count 66 transition count 72
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 108 place count 48 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 42 transition count 66
Applied a total of 120 rules in 11 ms. Remains 42 /102 variables (removed 60) and now considering 66/126 (removed 60) transitions.
[2022-05-17 09:20:03] [INFO ] Flow matrix only has 60 transitions (discarded 6 similar events)
// Phase 1: matrix 60 rows 42 cols
[2022-05-17 09:20:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:03] [INFO ] Implicit Places using invariants in 35 ms returned [31, 33, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/102 places, 66/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 39/102 places, 66/126 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (EQ s26 1) (EQ s32 1)) (AND (EQ s24 1) (EQ s30 1)) (AND (EQ s25 1) (EQ s31 1)) (AND (EQ s29 1) (EQ s35 1)) (AND (EQ s27 1) (EQ s34 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-05 finished in 235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((X(p1)||p0)))||G(p2)))'
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:03] [INFO ] Implicit Places using invariants in 42 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s32 1) (EQ s33 1) (EQ s34 1) (EQ s35 1) (EQ s37 1) (EQ s36 1) (EQ s39 1) (EQ s38 1) (EQ s40 1) (EQ s43 1) (EQ s23 1) (EQ s25 1) (EQ s26 1) (EQ ...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 14766 reset in 178 ms.
Product exploration explored 100000 steps with 14810 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-17 09:20:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2022-05-17 09:20:04] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 09:20:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 09:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:05] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-17 09:20:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:20:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-17 09:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-17 09:20:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:20:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2022-05-17 09:20:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2022-05-17 09:20:05] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2022-05-17 09:20:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2022-05-17 09:20:05] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-05-17 09:20:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2022-05-17 09:20:05] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 6 ms.
[2022-05-17 09:20:05] [INFO ] Added : 90 causal constraints over 18 iterations in 231 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 33 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:05] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2022-05-17 09:20:05] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 09:20:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2022-05-17 09:20:05] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2022-05-17 09:20:05] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-17 09:20:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:20:05] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-05-17 09:20:05] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2022-05-17 09:20:05] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 09:20:05] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-17 09:20:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2022-05-17 09:20:06] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 09:20:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-17 09:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-17 09:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:20:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-05-17 09:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:20:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-17 09:20:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:20:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2022-05-17 09:20:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2022-05-17 09:20:06] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2022-05-17 09:20:06] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2022-05-17 09:20:06] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-05-17 09:20:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 174 ms
[2022-05-17 09:20:06] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 6 ms.
[2022-05-17 09:20:06] [INFO ] Added : 90 causal constraints over 18 iterations in 177 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14786 reset in 186 ms.
Product exploration explored 100000 steps with 14741 reset in 178 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 33 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 126/126 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 126
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 8 place count 99 transition count 132
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 99 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 97 transition count 130
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 97 transition count 130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 97 transition count 130
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 22 rules in 16 ms. Remains 97 /99 variables (removed 2) and now considering 130/126 (removed -4) transitions.
[2022-05-17 09:20:07] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 09:20:07] [INFO ] Flow matrix only has 124 transitions (discarded 6 similar events)
// Phase 1: matrix 124 rows 97 cols
[2022-05-17 09:20:07] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 09:20:07] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/99 places, 130/126 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/99 places, 130/126 transitions.
Product exploration explored 100000 steps with 14966 reset in 342 ms.
Product exploration explored 100000 steps with 15035 reset in 318 ms.
Built C files in :
/tmp/ltsmin16183648588574893876
[2022-05-17 09:20:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16183648588574893876
Running compilation step : cd /tmp/ltsmin16183648588574893876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin16183648588574893876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16183648588574893876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13549755384597184989.hoa' '--buchi-type=spotba'
LTSmin run took 152 ms.
FORMULA Peterson-PT-2-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-2-LTLFireability-07 finished in 5557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1))||p2) U G(p1)))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 90
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 72 place count 66 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 49 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 116 place count 44 transition count 68
Applied a total of 116 rules in 5 ms. Remains 44 /102 variables (removed 58) and now considering 68/126 (removed 58) transitions.
[2022-05-17 09:20:08] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 44 cols
[2022-05-17 09:20:08] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:20:08] [INFO ] Implicit Places using invariants in 53 ms returned [32, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/102 places, 68/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 42/102 places, 68/126 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s22 1) (EQ s33 1)), p2:(AND (EQ s26 1) (EQ s32 1) (EQ s7 1)), p0:(AND (EQ s26 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-08 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U !X((!(!F(p1)&&p2)||!F(p3)))))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:09] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:09] [INFO ] Implicit Places using invariants in 54 ms returned [85, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3) p1), (OR (NOT p2) (NOT p3) p1), true, p1, (NOT p3), p1]
Running random walk in product with property : Peterson-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s99 1)), p2:(EQ s12 1), p1:(EQ s63 1), p3:(AND (EQ s46 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-09 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 70 place count 67 transition count 73
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 106 place count 49 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 43 transition count 67
Applied a total of 118 rules in 5 ms. Remains 43 /102 variables (removed 59) and now considering 67/126 (removed 59) transitions.
[2022-05-17 09:20:09] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 43 cols
[2022-05-17 09:20:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:09] [INFO ] Implicit Places using invariants in 45 ms returned [32, 34, 35]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/102 places, 67/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 40/102 places, 67/126 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-10 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:(OR (NEQ s19 1) (NEQ s25 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]]
Product exploration explored 100000 steps with 2 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6794 steps, including 2 resets, run visited all 1 properties in 15 ms. (steps per millisecond=452 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2022-05-17 09:20:10] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 40 cols
[2022-05-17 09:20:10] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 09:20:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-17 09:20:10] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 40 cols
[2022-05-17 09:20:10] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-17 09:20:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-17 09:20:10] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-17 09:20:10] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 09:20:10] [INFO ] Flow matrix only has 61 transitions (discarded 6 similar events)
// Phase 1: matrix 61 rows 40 cols
[2022-05-17 09:20:10] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 09:20:10] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 67/67 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 315 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=157 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 109 ms.
Stack based approach found an accepted trace after 225 steps with 1 reset with depth 81 and stack size 71 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-10 finished in 1880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&G(p1)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 102 transition count 92
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 68 transition count 92
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 68 place count 68 transition count 75
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 46 transition count 70
Applied a total of 112 rules in 12 ms. Remains 46 /102 variables (removed 56) and now considering 70/126 (removed 56) transitions.
[2022-05-17 09:20:11] [INFO ] Flow matrix only has 64 transitions (discarded 6 similar events)
// Phase 1: matrix 64 rows 46 cols
[2022-05-17 09:20:11] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:20:11] [INFO ] Implicit Places using invariants in 37 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/102 places, 70/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/102 places, 70/126 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s10 1), p0:(EQ s32 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 905 reset in 113 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-13 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(((p0 U p1)&&p2)))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:11] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-17 09:20:11] [INFO ] Implicit Places using invariants in 44 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s65 0) (EQ s79 0)), p1:(EQ s72 1), p0:(AND (OR (EQ s32 1) (AND (EQ s65 1) (EQ s79 1))) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-14 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2022-05-17 09:20:11] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2022-05-17 09:20:11] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-17 09:20:11] [INFO ] Implicit Places using invariants in 47 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s17 0), p0:(EQ s76 0)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-PT-2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLFireability-15 finished in 556 ms.
All properties solved by simple procedures.
Total runtime 14616 ms.

BK_STOP 1652779212480

--------------------
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="Peterson-PT-2"
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 Peterson-PT-2, 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 r168-tall-165277016100052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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