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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 9 08:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 08:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:20 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 81K 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-1A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652964177103

Running Version 202205111006
[2022-05-19 12:42:59] [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 12:42:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 12:43:00] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2022-05-19 12:43:00] [INFO ] Transformed 165 places.
[2022-05-19 12:43:00] [INFO ] Transformed 355 transitions.
[2022-05-19 12:43:00] [INFO ] Found NUPN structural information;
[2022-05-19 12:43:00] [INFO ] Parsed PT model containing 165 places and 355 transitions in 534 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
FORMULA NoC3x3-PT-1A-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 145 transition count 218
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 145 transition count 218
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 65 place count 145 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 68 place count 142 transition count 193
Applied a total of 68 rules in 58 ms. Remains 142 /165 variables (removed 23) and now considering 193/247 (removed 54) transitions.
// Phase 1: matrix 193 rows 142 cols
[2022-05-19 12:43:00] [INFO ] Computed 37 place invariants in 21 ms
[2022-05-19 12:43:01] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 193 rows 142 cols
[2022-05-19 12:43:01] [INFO ] Computed 37 place invariants in 11 ms
[2022-05-19 12:43:01] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 142 cols
[2022-05-19 12:43:01] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-19 12:43:01] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/165 places, 193/247 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/165 places, 193/247 transitions.
Support contains 42 out of 142 places after structural reductions.
[2022-05-19 12:43:01] [INFO ] Flatten gal took : 97 ms
[2022-05-19 12:43:02] [INFO ] Flatten gal took : 50 ms
[2022-05-19 12:43:02] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 40 out of 142 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 142 cols
[2022-05-19 12:43:02] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-19 12:43:02] [INFO ] [Real]Absence check using 37 positive place invariants in 13 ms returned sat
[2022-05-19 12:43:02] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-19 12:43:03] [INFO ] After 158ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:43:03] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 12:43:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-05-19 12:43:03] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 12:43:03] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-19 12:43:03] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 3 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-1A-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 447 edges and 142 vertex of which 139 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(((X(p1)&&p0)||p2)) U X(p3))&&F(X(p4))))'
Support contains 8 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 139 transition count 193
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 133 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 133 transition count 187
Applied a total of 15 rules in 20 ms. Remains 133 /142 variables (removed 9) and now considering 187/193 (removed 6) transitions.
// Phase 1: matrix 187 rows 133 cols
[2022-05-19 12:43:03] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:03] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 187 rows 133 cols
[2022-05-19 12:43:03] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:04] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 187 rows 133 cols
[2022-05-19 12:43:04] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:04] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/142 places, 187/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/142 places, 187/193 transitions.
Stuttering acceptance computed with spot in 580 ms :[(OR (NOT p4) (NOT p3)), (NOT p3), (NOT p4), (NOT p3), (AND (NOT p2) (NOT p3) p1), true, (AND (NOT p2) p1), (OR p2 (AND p0 p1))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p4), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}], [{ cond=p2, acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s111 1), p0:(AND (EQ s59 1) (EQ s76 1)), p3:(EQ s30 1), p4:(AND (EQ s70 1) (EQ s92 1)), p1:(AND (EQ s44 1) (EQ s88 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-00 finished in 1231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(p0))&&X(p1)&&(X(p2)||p3)))))'
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 139 transition count 193
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 133 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 133 transition count 187
Applied a total of 15 rules in 14 ms. Remains 133 /142 variables (removed 9) and now considering 187/193 (removed 6) transitions.
// Phase 1: matrix 187 rows 133 cols
[2022-05-19 12:43:04] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:05] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 187 rows 133 cols
[2022-05-19 12:43:05] [INFO ] Computed 34 place invariants in 9 ms
[2022-05-19 12:43:05] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 187 rows 133 cols
[2022-05-19 12:43:05] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:05] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/142 places, 187/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/142 places, 187/193 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p3 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p3 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p1) (AND p3 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p3) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s20 1) (EQ s31 1)), p3:(EQ s83 1), p0:(OR (EQ s84 0) (EQ s122 0)), p2:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 824 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-03 finished in 1533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(!p0 U X(G(p1))) U X((X(F(p0))&&p2)))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 139 transition count 193
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 132 transition count 186
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 132 transition count 186
Applied a total of 17 rules in 11 ms. Remains 132 /142 variables (removed 10) and now considering 186/193 (removed 7) transitions.
// Phase 1: matrix 186 rows 132 cols
[2022-05-19 12:43:06] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:06] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 186 rows 132 cols
[2022-05-19 12:43:06] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:06] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 132 cols
[2022-05-19 12:43:06] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:07] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/142 places, 186/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/142 places, 186/193 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (NOT p0)), p1, (AND (NOT p0) p1), false, false, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 8}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s90 1)), p1:(EQ s55 1), p2:(AND (EQ s53 1) (EQ s63 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, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 12735 reset in 598 ms.
Stack based approach found an accepted trace after 19 steps with 3 reset with depth 4 and stack size 4 in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-04 finished in 1621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(((p1 U G(p2))||p0)))))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Graph (trivial) has 77 edges and 142 vertex of which 40 / 142 are part of one of the 17 SCC in 7 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 401 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 109 transition count 139
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 109 transition count 139
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 109 transition count 136
Applied a total of 21 rules in 48 ms. Remains 109 /142 variables (removed 33) and now considering 136/193 (removed 57) transitions.
[2022-05-19 12:43:08] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
// Phase 1: matrix 120 rows 109 cols
[2022-05-19 12:43:08] [INFO ] Computed 35 place invariants in 0 ms
[2022-05-19 12:43:08] [INFO ] Implicit Places using invariants in 93 ms returned []
[2022-05-19 12:43:08] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
// Phase 1: matrix 120 rows 109 cols
[2022-05-19 12:43:08] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-19 12:43:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-05-19 12:43:08] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2022-05-19 12:43:08] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-19 12:43:08] [INFO ] Flow matrix only has 120 transitions (discarded 16 similar events)
// Phase 1: matrix 120 rows 109 cols
[2022-05-19 12:43:08] [INFO ] Computed 35 place invariants in 9 ms
[2022-05-19 12:43:08] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/142 places, 136/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/142 places, 136/193 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s49 1) (AND (EQ s45 1) (EQ s51 1))), p2:(EQ s73 1), p1:(EQ s49 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-06 finished in 632 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(X(p0)))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 139 transition count 193
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 131 transition count 185
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 131 transition count 185
Applied a total of 19 rules in 6 ms. Remains 131 /142 variables (removed 11) and now considering 185/193 (removed 8) transitions.
// Phase 1: matrix 185 rows 131 cols
[2022-05-19 12:43:08] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:08] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2022-05-19 12:43:08] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:08] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2022-05-19 12:43:08] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:09] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/142 places, 185/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/142 places, 185/193 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s76 0) (EQ s82 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Product exploration explored 100000 steps with 33333 reset in 445 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-1A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-1A-LTLFireability-07 finished in 1619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G(p0))))&&F(p1)))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 139 transition count 193
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 132 transition count 186
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 132 transition count 186
Applied a total of 17 rules in 5 ms. Remains 132 /142 variables (removed 10) and now considering 186/193 (removed 7) transitions.
// Phase 1: matrix 186 rows 132 cols
[2022-05-19 12:43:10] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:10] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 186 rows 132 cols
[2022-05-19 12:43:10] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:10] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 132 cols
[2022-05-19 12:43:10] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/142 places, 186/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/142 places, 186/193 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s55 1) (EQ s101 1)), p0:(AND (EQ s113 1) (EQ s130 1) (EQ s55 1) (EQ s101 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 10489 steps with 6 reset in 44 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-08 finished in 716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(!p1))||G(!(X(p2)||p3)))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 140 transition count 193
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 133 transition count 186
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 133 transition count 186
Applied a total of 16 rules in 9 ms. Remains 133 /142 variables (removed 9) and now considering 186/193 (removed 7) transitions.
// Phase 1: matrix 186 rows 133 cols
[2022-05-19 12:43:11] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-19 12:43:11] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 186 rows 133 cols
[2022-05-19 12:43:11] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-19 12:43:11] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 133 cols
[2022-05-19 12:43:11] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-19 12:43:11] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/142 places, 186/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/142 places, 186/193 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND p1 p2) (AND p1 p3)), p1, (OR (AND p1 p3) (AND p1 p2)), (AND p1 p2), (OR (AND p1 p3) (AND p1 p2))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p3 (NOT p0) p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p0 p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p0 p2 p1), acceptance={} source=3 dest: 4}, { cond=(AND p3 p0 p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p3 (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p3 p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s110 1), p0:(AND (EQ s123 1) (EQ s124 1)), p1:(OR (EQ s110 1) (AND (EQ s55 1) (EQ s102 1))), p2:(AND (EQ s55 1) (EQ s102 1))], nbAcceptance=1, 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 50000 reset in 752 ms.
Product exploration explored 100000 steps with 50000 reset in 667 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 431 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p3 p0 p1))), (X (NOT (OR (AND p3 p1) (AND p2 p1)))), (X (NOT (AND (NOT p3) p0 p2 p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) p2 p1))), (X (NOT (AND p3 p0 p2 p1))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) p2 p1))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (AND (NOT p3) p0 p1))), (X (NOT p1)), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) p0 p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) p2 p1)))), (X (X (NOT (AND p3 p0 p2 p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 23 factoid took 580 ms. Reduced automaton from 5 states, 17 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-1A-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-1A-LTLFireability-11 finished in 2769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(X(X(!(p0 U p1))))))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Graph (trivial) has 80 edges and 142 vertex of which 42 / 142 are part of one of the 18 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 399 edges and 118 vertex of which 115 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 10 place count 107 transition count 137
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 107 transition count 137
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 107 transition count 135
Applied a total of 20 rules in 27 ms. Remains 107 /142 variables (removed 35) and now considering 135/193 (removed 58) transitions.
[2022-05-19 12:43:13] [INFO ] Flow matrix only has 118 transitions (discarded 17 similar events)
// Phase 1: matrix 118 rows 107 cols
[2022-05-19 12:43:13] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:13] [INFO ] Implicit Places using invariants in 106 ms returned []
[2022-05-19 12:43:13] [INFO ] Flow matrix only has 118 transitions (discarded 17 similar events)
// Phase 1: matrix 118 rows 107 cols
[2022-05-19 12:43:13] [INFO ] Computed 34 place invariants in 2 ms
[2022-05-19 12:43:14] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-19 12:43:14] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2022-05-19 12:43:14] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-19 12:43:14] [INFO ] Flow matrix only has 118 transitions (discarded 17 similar events)
// Phase 1: matrix 118 rows 107 cols
[2022-05-19 12:43:14] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/142 places, 135/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/142 places, 135/193 transitions.
Stuttering acceptance computed with spot in 83 ms :[p1, p1]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s74 1), p0:(AND (EQ s30 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-12 finished in 609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(X(G(p1)))))&&X(p2)))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 139 transition count 193
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 131 transition count 185
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 131 transition count 185
Applied a total of 19 rules in 4 ms. Remains 131 /142 variables (removed 11) and now considering 185/193 (removed 8) transitions.
// Phase 1: matrix 185 rows 131 cols
[2022-05-19 12:43:14] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:14] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2022-05-19 12:43:14] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:14] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2022-05-19 12:43:14] [INFO ] Computed 34 place invariants in 1 ms
[2022-05-19 12:43:15] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/142 places, 185/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/142 places, 185/193 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s60 1)), p2:(AND (EQ s33 0) (OR (EQ s38 0) (EQ s60 0))), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][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-1A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-14 finished in 935 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(p0))&&X(F(p1))) U (X(p2)||p0)))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 193/193 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 140 transition count 193
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 133 transition count 186
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 133 transition count 186
Applied a total of 16 rules in 5 ms. Remains 133 /142 variables (removed 9) and now considering 186/193 (removed 7) transitions.
// Phase 1: matrix 186 rows 133 cols
[2022-05-19 12:43:15] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-19 12:43:15] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 186 rows 133 cols
[2022-05-19 12:43:15] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-19 12:43:15] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 133 cols
[2022-05-19 12:43:15] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-19 12:43:15] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/142 places, 186/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/142 places, 186/193 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), true, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s10 1) (EQ s14 1)), p2:(AND (EQ s95 1) (EQ s126 1)), p1:(EQ s55 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-15 finished in 834 ms.
All properties solved by simple procedures.
Total runtime 16654 ms.

BK_STOP 1652964196318

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

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