Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127600261.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-3A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127600261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 133K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-3A-00
FORMULA_NAME NoC3x3-PT-3A-01
FORMULA_NAME NoC3x3-PT-3A-02
FORMULA_NAME NoC3x3-PT-3A-03
FORMULA_NAME NoC3x3-PT-3A-04
FORMULA_NAME NoC3x3-PT-3A-05
FORMULA_NAME NoC3x3-PT-3A-06
FORMULA_NAME NoC3x3-PT-3A-07
FORMULA_NAME NoC3x3-PT-3A-08
FORMULA_NAME NoC3x3-PT-3A-09
FORMULA_NAME NoC3x3-PT-3A-10
FORMULA_NAME NoC3x3-PT-3A-11
FORMULA_NAME NoC3x3-PT-3A-12
FORMULA_NAME NoC3x3-PT-3A-13
FORMULA_NAME NoC3x3-PT-3A-14
FORMULA_NAME NoC3x3-PT-3A-15

=== Now, execution of the tool begins

BK_START 1620954135238

Running Version 0
[2021-05-14 01:02:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 01:02:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 01:02:17] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-14 01:02:17] [INFO ] Transformed 370 places.
[2021-05-14 01:02:17] [INFO ] Transformed 450 transitions.
[2021-05-14 01:02:17] [INFO ] Found NUPN structural information;
[2021-05-14 01:02:17] [INFO ] Parsed PT model containing 370 places and 450 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 01:02:17] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 18 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 352 transition count 449
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 115 place count 255 transition count 334
Ensure Unique test removed 34 places
Iterating global reduction 1 with 131 rules applied. Total rules applied 246 place count 221 transition count 334
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 308 place count 221 transition count 272
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 332 place count 221 transition count 248
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 340 place count 213 transition count 248
Applied a total of 340 rules in 56 ms. Remains 213 /370 variables (removed 157) and now considering 248/449 (removed 201) transitions.
[2021-05-14 01:02:17] [INFO ] Flow matrix only has 234 transitions (discarded 14 similar events)
// Phase 1: matrix 234 rows 213 cols
[2021-05-14 01:02:17] [INFO ] Computed 67 place invariants in 15 ms
[2021-05-14 01:02:17] [INFO ] Implicit Places using invariants in 182 ms returned []
[2021-05-14 01:02:17] [INFO ] Flow matrix only has 234 transitions (discarded 14 similar events)
// Phase 1: matrix 234 rows 213 cols
[2021-05-14 01:02:17] [INFO ] Computed 67 place invariants in 4 ms
[2021-05-14 01:02:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:18] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2021-05-14 01:02:18] [INFO ] Flow matrix only has 234 transitions (discarded 14 similar events)
// Phase 1: matrix 234 rows 213 cols
[2021-05-14 01:02:18] [INFO ] Computed 67 place invariants in 6 ms
[2021-05-14 01:02:18] [INFO ] Dead Transitions using invariants and state equation in 125 ms returned []
Finished structural reductions, in 1 iterations. Remains : 213/370 places, 248/449 transitions.
[2021-05-14 01:02:18] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 01:02:18] [INFO ] Flatten gal took : 54 ms
FORMULA NoC3x3-PT-3A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 01:02:18] [INFO ] Flatten gal took : 24 ms
[2021-05-14 01:02:18] [INFO ] Input system was already deterministic with 248 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=191 ) properties (out of 27) seen :23
Running SMT prover for 4 properties.
[2021-05-14 01:02:19] [INFO ] Flow matrix only has 234 transitions (discarded 14 similar events)
// Phase 1: matrix 234 rows 213 cols
[2021-05-14 01:02:19] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-14 01:02:19] [INFO ] [Real]Absence check using 59 positive place invariants in 12 ms returned sat
[2021-05-14 01:02:19] [INFO ] [Real]Absence check using 59 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 01:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:19] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-14 01:02:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:02:19] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2021-05-14 01:02:19] [INFO ] [Nat]Absence check using 59 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 01:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:19] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2021-05-14 01:02:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2021-05-14 01:02:19] [INFO ] Computed and/alt/rep : 234/777/228 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-14 01:02:20] [INFO ] Added : 190 causal constraints over 39 iterations in 735 ms. Result :sat
[2021-05-14 01:02:20] [INFO ] [Real]Absence check using 59 positive place invariants in 28 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Real]Absence check using 59 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:20] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2021-05-14 01:02:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:02:20] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Nat]Absence check using 59 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:20] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2021-05-14 01:02:20] [INFO ] Computed and/alt/rep : 234/777/228 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-14 01:02:20] [INFO ] Added : 170 causal constraints over 36 iterations in 550 ms. Result :sat
[2021-05-14 01:02:20] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Real]Absence check using 59 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 01:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:20] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-14 01:02:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:02:21] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Nat]Absence check using 59 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:21] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-14 01:02:21] [INFO ] Computed and/alt/rep : 234/777/228 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-14 01:02:21] [INFO ] Added : 163 causal constraints over 34 iterations in 570 ms. Result :sat
[2021-05-14 01:02:21] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Real]Absence check using 59 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:21] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-14 01:02:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:02:21] [INFO ] [Nat]Absence check using 59 positive place invariants in 9 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Nat]Absence check using 59 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:02:21] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-14 01:02:21] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2021-05-14 01:02:21] [INFO ] Computed and/alt/rep : 234/777/228 causal constraints (skipped 5 transitions) in 14 ms.
[2021-05-14 01:02:22] [INFO ] Added : 139 causal constraints over 28 iterations in 404 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 213 transition count 200
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 98 place count 165 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 100 place count 163 transition count 198
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 116 place count 147 transition count 177
Ensure Unique test removed 9 places
Iterating global reduction 3 with 25 rules applied. Total rules applied 141 place count 138 transition count 177
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 159 place count 138 transition count 159
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 168 place count 129 transition count 159
Applied a total of 168 rules in 28 ms. Remains 129 /213 variables (removed 84) and now considering 159/248 (removed 89) transitions.
[2021-05-14 01:02:22] [INFO ] Flow matrix only has 150 transitions (discarded 9 similar events)
// Phase 1: matrix 150 rows 129 cols
[2021-05-14 01:02:22] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2021-05-14 01:02:22] [INFO ] Flow matrix only has 150 transitions (discarded 9 similar events)
// Phase 1: matrix 150 rows 129 cols
[2021-05-14 01:02:22] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 01:02:22] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-14 01:02:22] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2021-05-14 01:02:22] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-14 01:02:22] [INFO ] Flow matrix only has 150 transitions (discarded 9 similar events)
// Phase 1: matrix 150 rows 129 cols
[2021-05-14 01:02:22] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:22] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/213 places, 159/248 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s63 1) (NEQ s90 1)), p1:(AND (EQ s47 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-01 finished in 556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X(p1)) U (p2||X((p3||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 248
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 197 transition count 228
Ensure Unique test removed 8 places
Iterating global reduction 1 with 23 rules applied. Total rules applied 39 place count 189 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 189 transition count 220
Applied a total of 47 rules in 7 ms. Remains 189 /213 variables (removed 24) and now considering 220/248 (removed 28) transitions.
[2021-05-14 01:02:22] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2021-05-14 01:02:22] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2021-05-14 01:02:23] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:23] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2021-05-14 01:02:23] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 01:02:23] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/213 places, 220/248 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true]
Running random walk in product with property : NoC3x3-PT-3A-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p2:(AND (EQ s82 1) (EQ s101 1)), p0:(EQ s41 1), p3:(AND (EQ s23 1) (EQ s48 1)), p1:(AND (EQ s156 1) (EQ s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-3A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-02 finished in 474 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Graph (complete) has 638 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 212 transition count 201
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 165 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 164 transition count 200
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 113 place count 148 transition count 178
Ensure Unique test removed 9 places
Iterating global reduction 3 with 25 rules applied. Total rules applied 138 place count 139 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 154 place count 139 transition count 162
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 162 place count 132 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 131 transition count 161
Applied a total of 163 rules in 20 ms. Remains 131 /213 variables (removed 82) and now considering 161/248 (removed 87) transitions.
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
// Phase 1: matrix 153 rows 131 cols
[2021-05-14 01:02:23] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] Implicit Places using invariants in 53 ms returned []
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
// Phase 1: matrix 153 rows 131 cols
[2021-05-14 01:02:23] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-14 01:02:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2021-05-14 01:02:23] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
// Phase 1: matrix 153 rows 131 cols
[2021-05-14 01:02:23] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/213 places, 161/248 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (NEQ s119 1) (NEQ s82 1)) (OR (NEQ s27 1) (NEQ s58 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 115 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-03 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Graph (complete) has 638 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 212 transition count 198
Reduce places removed 50 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 53 rules applied. Total rules applied 104 place count 162 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 159 transition count 195
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 123 place count 143 transition count 173
Ensure Unique test removed 8 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 147 place count 135 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 16 rules applied. Total rules applied 163 place count 135 transition count 157
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 171 place count 127 transition count 157
Applied a total of 171 rules in 17 ms. Remains 127 /213 variables (removed 86) and now considering 157/248 (removed 91) transitions.
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2021-05-14 01:02:23] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2021-05-14 01:02:23] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:23] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-14 01:02:23] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2021-05-14 01:02:23] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-14 01:02:23] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2021-05-14 01:02:23] [INFO ] Computed 58 place invariants in 0 ms
[2021-05-14 01:02:24] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/213 places, 157/248 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s65 1) (NEQ s77 1)), p0:(AND (EQ s118 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 448 ms.
Stuttering criterion allowed to conclude after 386 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-3A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-05 finished in 799 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 248
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 196 transition count 226
Ensure Unique test removed 8 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 41 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 49 place count 188 transition count 218
Applied a total of 49 rules in 4 ms. Remains 188 /213 variables (removed 25) and now considering 218/248 (removed 30) transitions.
[2021-05-14 01:02:24] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:24] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2021-05-14 01:02:24] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:24] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:24] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2021-05-14 01:02:24] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:24] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:24] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 188/213 places, 218/248 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-3A-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(OR (NEQ s43 1) (NEQ s54 1)), p1:(OR (NEQ s155 1) (NEQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 35 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-06 finished in 483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Graph (complete) has 638 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 211 transition count 196
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 115 place count 154 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 153 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 153 transition count 189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 151 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 119 place count 151 transition count 188
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 150 transition count 188
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 136 place count 135 transition count 168
Ensure Unique test removed 8 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 159 place count 127 transition count 168
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 16 rules applied. Total rules applied 175 place count 127 transition count 152
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 193 place count 115 transition count 146
Applied a total of 193 rules in 18 ms. Remains 115 /213 variables (removed 98) and now considering 146/248 (removed 102) transitions.
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 115 cols
[2021-05-14 01:02:25] [INFO ] Computed 47 place invariants in 0 ms
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 145 transitions (discarded 1 similar events)
// Phase 1: matrix 145 rows 115 cols
[2021-05-14 01:02:25] [INFO ] Computed 47 place invariants in 1 ms
[2021-05-14 01:02:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2021-05-14 01:02:25] [INFO ] Redundant transitions in 47 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 92, 93, 95, 99, 102, 112, 113, 114, 116, 126, 127, 129, 132, 133, 134, 135, 141, 142]
Found 32 redundant transitions using SMT.
Drop transitions removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions :[142, 141, 135, 134, 133, 132, 129, 127, 126, 116, 114, 113, 112, 102, 99, 95, 93, 92, 79, 69, 66, 65, 58, 57, 56, 55, 54, 43, 42, 31, 30, 24]
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 113 transitions (discarded 1 similar events)
// Phase 1: matrix 113 rows 115 cols
[2021-05-14 01:02:25] [INFO ] Computed 47 place invariants in 0 ms
[2021-05-14 01:02:25] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 115/213 places, 114/248 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 115 transition count 102
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 91 transition count 102
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 91 transition count 98
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 45 edges and 83 vertex of which 16 / 83 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 53 place count 75 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 61 place count 75 transition count 86
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 88 place count 57 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 56 transition count 76
Graph (trivial) has 36 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 48 transition count 76
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 99 place count 48 transition count 68
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 116 place count 48 transition count 51
Applied a total of 116 rules in 12 ms. Remains 48 /115 variables (removed 67) and now considering 51/114 (removed 63) transitions.
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 50 transitions (discarded 1 similar events)
// Phase 1: matrix 50 rows 48 cols
[2021-05-14 01:02:25] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants in 26 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 47/213 places, 51/248 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2021-05-14 01:02:25] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 50 transitions (discarded 1 similar events)
// Phase 1: matrix 50 rows 47 cols
[2021-05-14 01:02:25] [INFO ] Computed 21 place invariants in 2 ms
[2021-05-14 01:02:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 3 iterations. Remains : 47/213 places, 51/248 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s24 0) (AND (EQ s26 1) (EQ s35 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 25 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-07 finished in 369 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Graph (complete) has 638 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 212 transition count 199
Reduce places removed 49 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 163 transition count 195
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 159 transition count 195
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 124 place count 142 transition count 172
Ensure Unique test removed 9 places
Iterating global reduction 3 with 26 rules applied. Total rules applied 150 place count 133 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 168 place count 133 transition count 154
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 177 place count 124 transition count 154
Applied a total of 177 rules in 12 ms. Remains 124 /213 variables (removed 89) and now considering 154/248 (removed 94) transitions.
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
// Phase 1: matrix 146 rows 124 cols
[2021-05-14 01:02:25] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
// Phase 1: matrix 146 rows 124 cols
[2021-05-14 01:02:25] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:02:25] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2021-05-14 01:02:25] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
// Phase 1: matrix 146 rows 124 cols
[2021-05-14 01:02:25] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 01:02:25] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 124/213 places, 154/248 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s45 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-08 finished in 293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Graph (complete) has 638 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 211 transition count 196
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 113 place count 155 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 154 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 114 place count 154 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 152 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 117 place count 152 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 151 transition count 189
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 135 place count 135 transition count 168
Ensure Unique test removed 9 places
Iterating global reduction 3 with 25 rules applied. Total rules applied 160 place count 126 transition count 168
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 178 place count 126 transition count 150
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 197 place count 113 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 113 transition count 143
Applied a total of 198 rules in 17 ms. Remains 113 /213 variables (removed 100) and now considering 143/248 (removed 105) transitions.
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 113 cols
[2021-05-14 01:02:25] [INFO ] Computed 47 place invariants in 0 ms
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
// Phase 1: matrix 142 rows 113 cols
[2021-05-14 01:02:25] [INFO ] Computed 47 place invariants in 1 ms
[2021-05-14 01:02:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2021-05-14 01:02:25] [INFO ] Redundant transitions in 30 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 101, 104, 105, 106, 112, 113, 114, 116, 120, 123, 124, 126, 129, 130, 131, 132, 138]
Found 30 redundant transitions using SMT.
Drop transitions removed 30 transitions
Redundant transitions reduction (with SMT) removed 30 transitions :[138, 132, 131, 130, 129, 126, 124, 123, 120, 116, 114, 113, 112, 106, 105, 104, 101, 69, 66, 65, 58, 57, 56, 55, 54, 43, 42, 31, 30, 24]
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
// Phase 1: matrix 112 rows 113 cols
[2021-05-14 01:02:25] [INFO ] Computed 47 place invariants in 0 ms
[2021-05-14 01:02:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 113/213 places, 113/248 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 113 transition count 101
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 89 transition count 101
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 89 transition count 96
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 12 / 79 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 57 place count 73 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 63 place count 73 transition count 85
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 87 place count 57 transition count 77
Graph (trivial) has 33 edges and 57 vertex of which 12 / 57 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 51 transition count 77
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 94 place count 51 transition count 71
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 106 place count 51 transition count 59
Applied a total of 106 rules in 8 ms. Remains 51 /113 variables (removed 62) and now considering 59/113 (removed 54) transitions.
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 57 transitions (discarded 2 similar events)
// Phase 1: matrix 57 rows 51 cols
[2021-05-14 01:02:25] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 01:02:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2021-05-14 01:02:25] [INFO ] Flow matrix only has 57 transitions (discarded 2 similar events)
// Phase 1: matrix 57 rows 51 cols
[2021-05-14 01:02:25] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 01:02:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-14 01:02:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 51/213 places, 59/248 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s22 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-09 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(G(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Graph (complete) has 638 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 212 transition count 199
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 163 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 162 transition count 198
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 116 place count 147 transition count 179
Ensure Unique test removed 9 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 140 place count 138 transition count 179
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 158 place count 138 transition count 161
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 167 place count 129 transition count 161
Applied a total of 167 rules in 11 ms. Remains 129 /213 variables (removed 84) and now considering 161/248 (removed 87) transitions.
[2021-05-14 01:02:26] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
// Phase 1: matrix 151 rows 129 cols
[2021-05-14 01:02:26] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:02:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2021-05-14 01:02:26] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
// Phase 1: matrix 151 rows 129 cols
[2021-05-14 01:02:26] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:02:26] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-14 01:02:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2021-05-14 01:02:26] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 01:02:26] [INFO ] Flow matrix only has 151 transitions (discarded 10 similar events)
// Phase 1: matrix 151 rows 129 cols
[2021-05-14 01:02:26] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:26] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/213 places, 161/248 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3A-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s109 0) (EQ s125 0)), p1:(AND (EQ s109 1) (EQ s125 1)), p2:(OR (NEQ s22 1) (NEQ s27 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 452 ms.
Product exploration explored 100000 steps with 0 reset in 635 ms.
Knowledge obtained : [p0, (NOT p1), p2]
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 186 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-10 finished in 1651 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F((p1||X(X(X(p0))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 248
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 195 transition count 225
Ensure Unique test removed 9 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 44 place count 186 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 53 place count 186 transition count 216
Applied a total of 53 rules in 4 ms. Remains 186 /213 variables (removed 27) and now considering 216/248 (removed 32) transitions.
[2021-05-14 01:02:27] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2021-05-14 01:02:27] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-14 01:02:27] [INFO ] Implicit Places using invariants in 64 ms returned []
[2021-05-14 01:02:27] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2021-05-14 01:02:27] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:27] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2021-05-14 01:02:27] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2021-05-14 01:02:27] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:28] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 186/213 places, 216/248 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s71 1)), p0:(AND (EQ s134 1) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-11 finished in 440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 248
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 197 transition count 228
Ensure Unique test removed 9 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 40 place count 188 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 49 place count 188 transition count 219
Applied a total of 49 rules in 4 ms. Remains 188 /213 variables (removed 25) and now considering 219/248 (removed 29) transitions.
[2021-05-14 01:02:28] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:28] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:02:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2021-05-14 01:02:28] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:28] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:02:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:28] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2021-05-14 01:02:28] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:28] [INFO ] Computed 57 place invariants in 7 ms
[2021-05-14 01:02:28] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 188/213 places, 219/248 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-3A-13 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(AND (EQ s87 1) (EQ s101 1)), p1:(AND (EQ s59 1) (EQ s63 1) (EQ s118 1) (EQ s184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-13 finished in 444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(p0)&&(X(G(p1))||(p2&&F(p0))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 248
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 196 transition count 226
Ensure Unique test removed 8 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 41 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 49 place count 188 transition count 218
Applied a total of 49 rules in 4 ms. Remains 188 /213 variables (removed 25) and now considering 218/248 (removed 30) transitions.
[2021-05-14 01:02:28] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:28] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 01:02:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2021-05-14 01:02:28] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:28] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:28] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2021-05-14 01:02:28] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2021-05-14 01:02:28] [INFO ] Computed 58 place invariants in 1 ms
[2021-05-14 01:02:28] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 188/213 places, 218/248 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s175 0) (EQ s180 0)), p0:(OR (NEQ s151 1) (NEQ s168 1)), p1:(OR (NEQ s79 1) (NEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 531 ms.
Product exploration explored 100000 steps with 50000 reset in 506 ms.
Knowledge obtained : [p2, p0, p1]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Product exploration explored 100000 steps with 50000 reset in 504 ms.
[2021-05-14 01:02:31] [INFO ] Flatten gal took : 16 ms
[2021-05-14 01:02:31] [INFO ] Flatten gal took : 15 ms
[2021-05-14 01:02:31] [INFO ] Time to serialize gal into /tmp/LTL2960381340673412433.gal : 7 ms
[2021-05-14 01:02:31] [INFO ] Time to serialize properties into /tmp/LTL5168764889330871176.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2960381340673412433.gal, -t, CGAL, -LTL, /tmp/LTL5168764889330871176.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2960381340673412433.gal -t CGAL -LTL /tmp/LTL5168764889330871176.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((X("((p297!=1)||(p335!=1))"))&&((X(G("((p141!=1)||(p215!=1))")))||((F("((p297!=1)||(p335!=1))"))&&("((p346==0)||(p359==0))"))))))
Formula 0 simplified : !F(X"((p297!=1)||(p335!=1))" & (XG"((p141!=1)||(p215!=1))" | ("((p346==0)||(p359==0))" & F"((p297!=1)||(p335!=1))")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
85 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.882206,39292,1,0,6,148856,20,0,4642,89886,11
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-3A-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property NoC3x3-PT-3A-14 finished in 3805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)&&(G(p1)||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 248/248 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 248
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 196 transition count 226
Ensure Unique test removed 9 places
Iterating global reduction 1 with 25 rules applied. Total rules applied 42 place count 187 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 51 place count 187 transition count 217
Applied a total of 51 rules in 4 ms. Remains 187 /213 variables (removed 26) and now considering 217/248 (removed 31) transitions.
[2021-05-14 01:02:32] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2021-05-14 01:02:32] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2021-05-14 01:02:32] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2021-05-14 01:02:32] [INFO ] Computed 57 place invariants in 0 ms
[2021-05-14 01:02:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2021-05-14 01:02:32] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2021-05-14 01:02:32] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2021-05-14 01:02:32] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 01:02:32] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 187/213 places, 217/248 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) p2), (AND p1 (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s117 0) (EQ s183 0)), p2:(AND (EQ s117 1) (EQ s183 1)), p0:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-15 finished in 553 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620954154515

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3A"
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-3A, 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 r140-tall-162089127600261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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