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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 13:09 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.6K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 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 144K 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-4A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652991128161

Running Version 202205111006
[2022-05-19 20:12:10] [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-19 20:12:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:12:10] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2022-05-19 20:12:10] [INFO ] Transformed 293 places.
[2022-05-19 20:12:10] [INFO ] Transformed 608 transitions.
[2022-05-19 20:12:10] [INFO ] Found NUPN structural information;
[2022-05-19 20:12:10] [INFO ] Parsed PT model containing 293 places and 608 transitions in 443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
FORMULA NoC3x3-PT-4A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 453/453 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 245 transition count 379
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 245 transition count 379
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 142 place count 245 transition count 333
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 236 transition count 333
Applied a total of 151 rules in 121 ms. Remains 236 /293 variables (removed 57) and now considering 333/453 (removed 120) transitions.
// Phase 1: matrix 333 rows 236 cols
[2022-05-19 20:12:11] [INFO ] Computed 57 place invariants in 18 ms
[2022-05-19 20:12:11] [INFO ] Implicit Places using invariants in 557 ms returned []
// Phase 1: matrix 333 rows 236 cols
[2022-05-19 20:12:11] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-19 20:12:12] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
// Phase 1: matrix 333 rows 236 cols
[2022-05-19 20:12:12] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-19 20:12:12] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 236/293 places, 333/453 transitions.
Finished structural reductions, in 1 iterations. Remains : 236/293 places, 333/453 transitions.
Support contains 38 out of 236 places after structural reductions.
[2022-05-19 20:12:13] [INFO ] Flatten gal took : 128 ms
[2022-05-19 20:12:13] [INFO ] Flatten gal took : 64 ms
[2022-05-19 20:12:13] [INFO ] Input system was already deterministic with 333 transitions.
Support contains 37 out of 236 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=11 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 333 rows 236 cols
[2022-05-19 20:12:14] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 20:12:14] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2022-05-19 20:12:14] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 20:12:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-05-19 20:12:15] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 20:12:15] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-19 20:12:15] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 151 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 2 properties in 9 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-4A-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 138 edges and 236 vertex of which 75 / 236 are part of one of the 33 SCC in 4 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 187 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 187 transition count 243
Applied a total of 15 rules in 42 ms. Remains 187 /236 variables (removed 49) and now considering 243/333 (removed 90) transitions.
[2022-05-19 20:12:15] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:15] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-19 20:12:16] [INFO ] Implicit Places using invariants in 205 ms returned []
[2022-05-19 20:12:16] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:16] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:16] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-05-19 20:12:16] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2022-05-19 20:12:16] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-19 20:12:16] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:16] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:16] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/236 places, 243/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/236 places, 243/333 transitions.
Stuttering acceptance computed with spot in 370 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s72 1) (EQ s89 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 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-00 finished in 1599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)||F(p1)) U p2))'
Support contains 6 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 132 edges and 236 vertex of which 71 / 236 are part of one of the 31 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 190 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 190 transition count 248
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 190 transition count 246
Applied a total of 15 rules in 31 ms. Remains 190 /236 variables (removed 46) and now considering 246/333 (removed 87) transitions.
[2022-05-19 20:12:17] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 190 cols
[2022-05-19 20:12:17] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:17] [INFO ] Implicit Places using invariants in 171 ms returned []
[2022-05-19 20:12:17] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 190 cols
[2022-05-19 20:12:17] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:17] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-19 20:12:17] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2022-05-19 20:12:18] [INFO ] Redundant transitions in 43 ms returned []
[2022-05-19 20:12:18] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 190 cols
[2022-05-19 20:12:18] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:18] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/236 places, 246/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/236 places, 246/333 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), true, p0, p1]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s163 1) (EQ s171 1)), p1:(AND (EQ s23 1) (EQ s34 1)), p0:(AND (EQ s18 1) (EQ s110 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 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-02 finished in 1120 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p0)||p1)) U (X(p2)||p3))))'
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 229 transition count 326
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 229 transition count 326
Applied a total of 14 rules in 11 ms. Remains 229 /236 variables (removed 7) and now considering 326/333 (removed 7) transitions.
// Phase 1: matrix 326 rows 229 cols
[2022-05-19 20:12:18] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:18] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 326 rows 229 cols
[2022-05-19 20:12:18] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:19] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
// Phase 1: matrix 326 rows 229 cols
[2022-05-19 20:12:19] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-19 20:12:19] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 229/236 places, 326/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/236 places, 326/333 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s107 1) (EQ s132 1) (EQ s24 1) (EQ s45 1)), p1:(AND (EQ s15 1) (EQ s33 1)), p0:(EQ s13 1), p2:(AND (EQ s24 1) (EQ s45 1))], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 147 reset in 1015 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 4 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-05 finished in 2183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 137 edges and 236 vertex of which 73 / 236 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 187 transition count 244
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 187 transition count 244
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 187 transition count 243
Applied a total of 18 rules in 44 ms. Remains 187 /236 variables (removed 49) and now considering 243/333 (removed 90) transitions.
[2022-05-19 20:12:20] [INFO ] Flow matrix only has 212 transitions (discarded 31 similar events)
// Phase 1: matrix 212 rows 187 cols
[2022-05-19 20:12:20] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:20] [INFO ] Implicit Places using invariants in 198 ms returned []
[2022-05-19 20:12:20] [INFO ] Flow matrix only has 212 transitions (discarded 31 similar events)
// Phase 1: matrix 212 rows 187 cols
[2022-05-19 20:12:20] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-19 20:12:21] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2022-05-19 20:12:21] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 20:12:21] [INFO ] Flow matrix only has 212 transitions (discarded 31 similar events)
// Phase 1: matrix 212 rows 187 cols
[2022-05-19 20:12:21] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:21] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/236 places, 243/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/236 places, 243/333 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s94 1) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-06 finished in 1065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(p0))))'
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 228 transition count 325
Applied a total of 16 rules in 12 ms. Remains 228 /236 variables (removed 8) and now considering 325/333 (removed 8) transitions.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:21] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:22] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:22] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 20:12:22] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:22] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:22] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/236 places, 325/333 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s118 0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-07 finished in 1207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 138 edges and 236 vertex of which 75 / 236 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 187 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 187 transition count 243
Applied a total of 15 rules in 16 ms. Remains 187 /236 variables (removed 49) and now considering 243/333 (removed 90) transitions.
[2022-05-19 20:12:22] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:22] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:23] [INFO ] Implicit Places using invariants in 208 ms returned []
[2022-05-19 20:12:23] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:23] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:23] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-05-19 20:12:23] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2022-05-19 20:12:23] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 20:12:23] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:23] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:24] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/236 places, 243/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/236 places, 243/333 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s19 1) (NEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-09 finished in 1279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)&&F(p2)&&p0) U X(p1)))'
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 228 transition count 325
Applied a total of 16 rules in 6 ms. Remains 228 /236 variables (removed 8) and now considering 325/333 (removed 8) transitions.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:24] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:24] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:24] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:24] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:24] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:25] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/236 places, 325/333 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s141 1) (EQ s152 1)), p2:(EQ s39 1), p1:(EQ s197 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-10 finished in 1268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 138 edges and 236 vertex of which 75 / 236 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 187 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 187 transition count 243
Applied a total of 15 rules in 16 ms. Remains 187 /236 variables (removed 49) and now considering 243/333 (removed 90) transitions.
[2022-05-19 20:12:25] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:25] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:25] [INFO ] Implicit Places using invariants in 231 ms returned []
[2022-05-19 20:12:25] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:25] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:25] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-05-19 20:12:26] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2022-05-19 20:12:26] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-19 20:12:26] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:26] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:26] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/236 places, 243/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/236 places, 243/333 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s143 1) (EQ s156 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-11 finished in 1076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(X(X(G(X(p0)))))))))'
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 137 edges and 236 vertex of which 74 / 236 are part of one of the 33 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 186 transition count 222
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 60 place count 164 transition count 222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 156 transition count 214
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 156 transition count 214
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 101 place count 156 transition count 189
Applied a total of 101 rules in 44 ms. Remains 156 /236 variables (removed 80) and now considering 189/333 (removed 144) transitions.
// Phase 1: matrix 189 rows 156 cols
[2022-05-19 20:12:26] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-19 20:12:26] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 189 rows 156 cols
[2022-05-19 20:12:26] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-19 20:12:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-05-19 20:12:27] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2022-05-19 20:12:27] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 189 rows 156 cols
[2022-05-19 20:12:27] [INFO ] Computed 49 place invariants in 1 ms
[2022-05-19 20:12:27] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/236 places, 189/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 156/236 places, 189/333 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-12 finished in 931 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(F(!(G(F(p1)) U p2)))))'
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 228 transition count 325
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 228 transition count 325
Applied a total of 16 rules in 10 ms. Remains 228 /236 variables (removed 8) and now considering 325/333 (removed 8) transitions.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:27] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:27] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:27] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:28] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:28] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:28] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/236 places, 325/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/236 places, 325/333 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2, (AND p2 p1)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s34 1) (EQ s44 1)) (EQ s83 1)), p2:(EQ s83 1), p1:(AND (EQ s191 1) (EQ s204 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 686 ms.
Product exploration explored 100000 steps with 0 reset in 754 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 563 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 169 ms :[p2, p2, p2, (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 325 rows 228 cols
[2022-05-19 20:12:31] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:31] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2022-05-19 20:12:31] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 20:12:31] [INFO ] [Nat]Absence check using 57 positive place invariants in 12 ms returned sat
[2022-05-19 20:12:31] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 20:12:31] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-19 20:12:31] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=40 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 928 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 263 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 173 ms :[p2, p2, p2, (AND p2 p1)]
Support contains 3 out of 228 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 325/325 transitions.
Graph (trivial) has 131 edges and 228 vertex of which 70 / 228 are part of one of the 31 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 189 transition count 246
Applied a total of 3 rules in 27 ms. Remains 189 /228 variables (removed 39) and now considering 246/325 (removed 79) transitions.
[2022-05-19 20:12:33] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 189 cols
[2022-05-19 20:12:33] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:33] [INFO ] Implicit Places using invariants in 265 ms returned []
[2022-05-19 20:12:33] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 189 cols
[2022-05-19 20:12:33] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:33] [INFO ] State equation strengthened by 94 read => feed constraints.
[2022-05-19 20:12:33] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2022-05-19 20:12:33] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 20:12:33] [INFO ] Flow matrix only has 216 transitions (discarded 30 similar events)
// Phase 1: matrix 216 rows 189 cols
[2022-05-19 20:12:33] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:34] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/228 places, 246/325 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/228 places, 246/325 transitions.
Computed a total of 9 stabilizing places and 1 stable transitions
Computed a total of 9 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 508 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[p2, p2, p2, (AND p2 p1)]
Finished random walk after 359 steps, including 0 resets, run visited all 5 properties in 16 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 484 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 175 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 187 ms :[p2, p2, p2, (AND p2 p1)]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-13 finished in 8344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(F(p0)) U G((G(p0)||F(p1))))) U p0))'
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 134 edges and 236 vertex of which 71 / 236 are part of one of the 31 SCC in 4 ms
Free SCC test removed 40 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 42 place count 186 transition count 221
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 162 transition count 221
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 154 transition count 213
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 154 transition count 213
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 106 place count 154 transition count 189
Applied a total of 106 rules in 71 ms. Remains 154 /236 variables (removed 82) and now considering 189/333 (removed 144) transitions.
// Phase 1: matrix 189 rows 154 cols
[2022-05-19 20:12:35] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-19 20:12:36] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 189 rows 154 cols
[2022-05-19 20:12:36] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-19 20:12:36] [INFO ] State equation strengthened by 52 read => feed constraints.
[2022-05-19 20:12:36] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2022-05-19 20:12:36] [INFO ] Redundant transitions in 105 ms returned []
// Phase 1: matrix 189 rows 154 cols
[2022-05-19 20:12:36] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-19 20:12:36] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/236 places, 189/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/236 places, 189/333 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s55 1), p1:(EQ s117 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-14 finished in 1228 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 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 333/333 transitions.
Graph (trivial) has 138 edges and 236 vertex of which 75 / 236 are part of one of the 33 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 187 transition count 243
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 187 transition count 243
Applied a total of 15 rules in 20 ms. Remains 187 /236 variables (removed 49) and now considering 243/333 (removed 90) transitions.
[2022-05-19 20:12:37] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:37] [INFO ] Computed 57 place invariants in 0 ms
[2022-05-19 20:12:37] [INFO ] Implicit Places using invariants in 259 ms returned []
[2022-05-19 20:12:37] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:37] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 20:12:37] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-05-19 20:12:37] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2022-05-19 20:12:37] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-19 20:12:37] [INFO ] Flow matrix only has 211 transitions (discarded 32 similar events)
// Phase 1: matrix 211 rows 187 cols
[2022-05-19 20:12:37] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 20:12:38] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 187/236 places, 243/333 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/236 places, 243/333 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s37 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4A-LTLFireability-15 finished in 1227 ms.
All properties solved by simple procedures.
Total runtime 28106 ms.

BK_STOP 1652991158420

--------------------
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-4A"
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-4A, 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-165276998500164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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