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.r150-smll-165276998600228.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 NoC3x3-PT-8A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 6.8K Apr 29 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 745K 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 NoC3x3-PT-8A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653040735760

Running Version 202205111006
[2022-05-20 09:58:58] [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-20 09:58:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:58:59] [INFO ] Load time of PNML (sax parser for PT used): 489 ms
[2022-05-20 09:58:59] [INFO ] Transformed 317 places.
[2022-05-20 09:58:59] [INFO ] Transformed 4293 transitions.
[2022-05-20 09:58:59] [INFO ] Found NUPN structural information;
[2022-05-20 09:58:59] [INFO ] Parsed PT model containing 317 places and 4293 transitions in 769 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 156 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 265 transition count 578
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 265 transition count 578
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 0 with 64 rules applied. Total rules applied 168 place count 265 transition count 514
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 176 place count 257 transition count 514
Applied a total of 176 rules in 115 ms. Remains 257 /317 variables (removed 60) and now considering 514/686 (removed 172) transitions.
// Phase 1: matrix 514 rows 257 cols
[2022-05-20 09:58:59] [INFO ] Computed 58 place invariants in 26 ms
[2022-05-20 09:59:00] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 514 rows 257 cols
[2022-05-20 09:59:00] [INFO ] Computed 58 place invariants in 13 ms
[2022-05-20 09:59:00] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
// Phase 1: matrix 514 rows 257 cols
[2022-05-20 09:59:00] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-20 09:59:01] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 257/317 places, 514/686 transitions.
Finished structural reductions, in 1 iterations. Remains : 257/317 places, 514/686 transitions.
Support contains 32 out of 257 places after structural reductions.
[2022-05-20 09:59:02] [INFO ] Flatten gal took : 200 ms
[2022-05-20 09:59:02] [INFO ] Flatten gal took : 90 ms
[2022-05-20 09:59:02] [INFO ] Input system was already deterministic with 514 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 902 ms. (steps per millisecond=11 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 514 rows 257 cols
[2022-05-20 09:59:03] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-20 09:59:03] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2022-05-20 09:59:04] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 09:59:04] [INFO ] [Nat]Absence check using 58 positive place invariants in 39 ms returned sat
[2022-05-20 09:59:04] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 09:59:04] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-20 09:59:04] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 15 ms.
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 514/514 transitions.
Graph (trivial) has 161 edges and 257 vertex of which 73 / 257 are part of one of the 32 SCC in 7 ms
Free SCC test removed 41 places
Drop transitions removed 91 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 162 transitions.
Graph (complete) has 653 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 212 transition count 349
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 212 transition count 349
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 54 place count 189 transition count 326
Drop transitions removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 163 place count 189 transition count 217
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 186 place count 189 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 187 place count 188 transition count 216
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 33 rules applied. Total rules applied 220 place count 179 transition count 192
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 244 place count 155 transition count 192
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 245 place count 155 transition count 192
Applied a total of 245 rules in 169 ms. Remains 155 /257 variables (removed 102) and now considering 192/514 (removed 322) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/257 places, 192/514 transitions.
Finished random walk after 339 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=48 )
FORMULA NoC3x3-PT-8A-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 1127 edges and 257 vertex of which 256 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X((p0 U p1)) U (X(p2)&&p3))))'
Support contains 5 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 514
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 253 transition count 511
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 253 transition count 511
Applied a total of 7 rules in 14 ms. Remains 253 /257 variables (removed 4) and now considering 511/514 (removed 3) transitions.
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:05] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 09:59:05] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:05] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 09:59:06] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:06] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 09:59:06] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/257 places, 511/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/257 places, 511/514 transitions.
Stuttering acceptance computed with spot in 568 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p3) (NOT p2)), p1, (NOT p2), true]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 2}, { cond=p3, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(OR (NEQ s223 1) (EQ s40 1)), p0:(NEQ s17 1), p1:(EQ s223 1), p2:(AND (EQ s8 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 295 steps with 1 reset in 20 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-00 finished in 1632 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Graph (trivial) has 164 edges and 257 vertex of which 75 / 257 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 835 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 204 transition count 349
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 180 transition count 349
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 176 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 176 transition count 345
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 121 place count 153 transition count 322
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 257 place count 153 transition count 186
Applied a total of 257 rules in 67 ms. Remains 153 /257 variables (removed 104) and now considering 186/514 (removed 328) transitions.
// Phase 1: matrix 186 rows 153 cols
[2022-05-20 09:59:07] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:07] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 186 rows 153 cols
[2022-05-20 09:59:07] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-20 09:59:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-20 09:59:07] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2022-05-20 09:59:07] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 186 rows 153 cols
[2022-05-20 09:59:07] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:07] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/257 places, 186/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/257 places, 186/514 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-02 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:(EQ s39 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-02 finished in 877 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 514
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 253 transition count 511
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 253 transition count 511
Applied a total of 7 rules in 21 ms. Remains 253 /257 variables (removed 4) and now considering 511/514 (removed 3) transitions.
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:07] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 09:59:08] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:08] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 09:59:08] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:08] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 09:59:09] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/257 places, 511/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/257 places, 511/514 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s143 1) (NEQ s105 1) (NEQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1780 ms.
Product exploration explored 100000 steps with 50000 reset in 1292 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-8A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-03 finished in 4760 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&p1)))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Graph (trivial) has 163 edges and 257 vertex of which 75 / 257 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 835 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 204 transition count 349
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 180 transition count 349
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 176 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 119 place count 154 transition count 323
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 255 place count 154 transition count 187
Applied a total of 255 rules in 50 ms. Remains 154 /257 variables (removed 103) and now considering 187/514 (removed 327) transitions.
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:12] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:12] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:12] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-20 09:59:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-20 09:59:13] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2022-05-20 09:59:13] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:13] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:13] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/257 places, 187/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/257 places, 187/514 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s105 0), p0:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-04 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(!(p0 U X(F(p1))))) U p2)&&F(p0)))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 514
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 252 transition count 510
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 252 transition count 510
Applied a total of 9 rules in 7 ms. Remains 252 /257 variables (removed 5) and now considering 510/514 (removed 4) transitions.
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:13] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 09:59:13] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:13] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-20 09:59:14] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:14] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 09:59:14] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/257 places, 510/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/257 places, 510/514 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) p1), p1, true]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s190 1), p2:(AND (EQ s190 1) (EQ s116 1) (EQ s145 1)), p1:(AND (EQ s116 1) (EQ s145 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 25 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-05 finished in 1569 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 253 transition count 510
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 253 transition count 510
Applied a total of 8 rules in 9 ms. Remains 253 /257 variables (removed 4) and now considering 510/514 (removed 4) transitions.
// Phase 1: matrix 510 rows 253 cols
[2022-05-20 09:59:15] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-20 09:59:15] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 510 rows 253 cols
[2022-05-20 09:59:15] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-20 09:59:15] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 253 cols
[2022-05-20 09:59:15] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-20 09:59:16] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/257 places, 510/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/257 places, 510/514 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s15 1)) (AND (EQ s89 1) (EQ s94 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 257 reset in 828 ms.
Stack based approach found an accepted trace after 154 steps with 0 reset with depth 155 and stack size 155 in 3 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-06 finished in 2465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((p0 U G((G(p1)||p2)))))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Graph (trivial) has 163 edges and 257 vertex of which 75 / 257 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 835 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 204 transition count 349
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 180 transition count 349
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 176 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 119 place count 154 transition count 323
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 255 place count 154 transition count 187
Applied a total of 255 rules in 50 ms. Remains 154 /257 variables (removed 103) and now considering 187/514 (removed 327) transitions.
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:17] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:17] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:17] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-20 09:59:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-20 09:59:18] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2022-05-20 09:59:18] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:18] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:18] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/257 places, 187/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/257 places, 187/514 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-07 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 p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s104 1), p2:(EQ s25 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-07 finished in 1054 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!X(p0))||G(p1)) U G(p1))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 514
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 252 transition count 510
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 252 transition count 510
Applied a total of 9 rules in 6 ms. Remains 252 /257 variables (removed 5) and now considering 510/514 (removed 4) transitions.
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:18] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 09:59:18] [INFO ] Implicit Places using invariants in 254 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:18] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 09:59:19] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:19] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 09:59:19] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/257 places, 510/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/257 places, 510/514 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s207 1) (EQ s217 1)), p0:(EQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24989 reset in 1057 ms.
Stack based approach found an accepted trace after 90 steps with 22 reset with depth 3 and stack size 3 in 2 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-08 finished in 2654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Graph (trivial) has 163 edges and 257 vertex of which 75 / 257 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 835 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 204 transition count 349
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 180 transition count 349
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 176 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 119 place count 154 transition count 323
Drop transitions removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 255 place count 154 transition count 187
Applied a total of 255 rules in 28 ms. Remains 154 /257 variables (removed 103) and now considering 187/514 (removed 327) transitions.
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:21] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:21] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:21] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2022-05-20 09:59:21] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2022-05-20 09:59:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 187 rows 154 cols
[2022-05-20 09:59:21] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:21] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/257 places, 187/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/257 places, 187/514 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-09 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s135 0), p1:(EQ s150 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-09 finished in 794 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((F(p1)&&p0))) U (p2 U p3)))'
Support contains 4 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 514
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 252 transition count 510
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 252 transition count 510
Applied a total of 9 rules in 7 ms. Remains 252 /257 variables (removed 5) and now considering 510/514 (removed 4) transitions.
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:22] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 09:59:22] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:22] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 09:59:22] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
// Phase 1: matrix 510 rows 252 cols
[2022-05-20 09:59:22] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-20 09:59:23] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 252/257 places, 510/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/257 places, 510/514 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(OR (EQ s218 1) (EQ s43 1)), p2:(EQ s247 1), p0:(AND (EQ s12 1) (EQ s43 1)), p1:(EQ s43 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-11 finished in 1831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)&&p0))||p2)))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 514
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 253 transition count 511
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 253 transition count 511
Applied a total of 7 rules in 10 ms. Remains 253 /257 variables (removed 4) and now considering 511/514 (removed 3) transitions.
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:23] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 09:59:24] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:24] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 09:59:24] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
// Phase 1: matrix 511 rows 253 cols
[2022-05-20 09:59:24] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-20 09:59:25] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/257 places, 511/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 253/257 places, 511/514 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p2:(EQ s227 0), p1:(EQ s227 1), p0:(AND (EQ s22 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1589 ms.
Product exploration explored 100000 steps with 50000 reset in 1571 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-8A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-13 finished in 4910 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 257/257 places, 514/514 transitions.
Graph (trivial) has 161 edges and 257 vertex of which 73 / 257 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 843 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 205 transition count 351
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 181 transition count 351
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 178 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 178 transition count 348
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 119 place count 155 transition count 325
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 249 place count 155 transition count 195
Applied a total of 249 rules in 33 ms. Remains 155 /257 variables (removed 102) and now considering 195/514 (removed 319) transitions.
// Phase 1: matrix 195 rows 155 cols
[2022-05-20 09:59:28] [INFO ] Computed 48 place invariants in 6 ms
[2022-05-20 09:59:28] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 195 rows 155 cols
[2022-05-20 09:59:28] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-20 09:59:29] [INFO ] State equation strengthened by 106 read => feed constraints.
[2022-05-20 09:59:29] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2022-05-20 09:59:29] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 195 rows 155 cols
[2022-05-20 09:59:29] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-20 09:59:29] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/257 places, 195/514 transitions.
Finished structural reductions, in 1 iterations. Remains : 155/257 places, 195/514 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s82 0)), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-15 finished in 987 ms.
All properties solved by simple procedures.
Total runtime 31517 ms.

BK_STOP 1653040769872

--------------------
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="NoC3x3-PT-8A"
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 NoC3x3-PT-8A, 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 r150-smll-165276998600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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