About the Execution of ITS-Tools for NoC3x3-PT-1A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 445.915 | 23820.00 | 36167.00 | 1324.40 | FFFFFTFFFTFFFFFF | normal |
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-162089127500229.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-1A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127500229
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 166K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K 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.2K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 81K 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-1A-00
FORMULA_NAME NoC3x3-PT-1A-01
FORMULA_NAME NoC3x3-PT-1A-02
FORMULA_NAME NoC3x3-PT-1A-03
FORMULA_NAME NoC3x3-PT-1A-04
FORMULA_NAME NoC3x3-PT-1A-05
FORMULA_NAME NoC3x3-PT-1A-06
FORMULA_NAME NoC3x3-PT-1A-07
FORMULA_NAME NoC3x3-PT-1A-08
FORMULA_NAME NoC3x3-PT-1A-09
FORMULA_NAME NoC3x3-PT-1A-10
FORMULA_NAME NoC3x3-PT-1A-11
FORMULA_NAME NoC3x3-PT-1A-12
FORMULA_NAME NoC3x3-PT-1A-13
FORMULA_NAME NoC3x3-PT-1A-14
FORMULA_NAME NoC3x3-PT-1A-15
=== Now, execution of the tool begins
BK_START 1620949460517
Running Version 0
[2021-05-13 23:44:22] [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-13 23:44:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:44:22] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-13 23:44:22] [INFO ] Transformed 165 places.
[2021-05-13 23:44:22] [INFO ] Transformed 355 transitions.
[2021-05-13 23:44:22] [INFO ] Found NUPN structural information;
[2021-05-13 23:44:22] [INFO ] Parsed PT model containing 165 places and 355 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 23:44:22] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
Support contains 42 out of 165 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 141 transition count 211
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 141 transition count 211
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 141 transition count 189
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 135 transition count 189
Applied a total of 76 rules in 29 ms. Remains 135 /165 variables (removed 30) and now considering 189/247 (removed 58) transitions.
// Phase 1: matrix 189 rows 135 cols
[2021-05-13 23:44:22] [INFO ] Computed 34 place invariants in 20 ms
[2021-05-13 23:44:22] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 189 rows 135 cols
[2021-05-13 23:44:22] [INFO ] Computed 34 place invariants in 7 ms
[2021-05-13 23:44:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 135 cols
[2021-05-13 23:44:22] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:22] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/165 places, 189/247 transitions.
[2021-05-13 23:44:23] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 23:44:23] [INFO ] Flatten gal took : 53 ms
FORMULA NoC3x3-PT-1A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 23:44:23] [INFO ] Flatten gal took : 19 ms
[2021-05-13 23:44:23] [INFO ] Input system was already deterministic with 189 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=241 ) properties (out of 31) seen :30
Running SMT prover for 1 properties.
// Phase 1: matrix 189 rows 135 cols
[2021-05-13 23:44:23] [INFO ] Computed 34 place invariants in 3 ms
[2021-05-13 23:44:23] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2021-05-13 23:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:44:23] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-13 23:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:44:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2021-05-13 23:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:44:23] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-13 23:44:23] [INFO ] Computed and/alt/rep : 188/740/188 causal constraints (skipped 0 transitions) in 19 ms.
[2021-05-13 23:44:24] [INFO ] Added : 166 causal constraints over 34 iterations in 532 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Graph (trivial) has 83 edges and 135 vertex of which 44 / 135 are part of one of the 19 SCC in 2 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 103 transition count 119
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 40 place count 89 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 85 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 85 transition count 115
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 61 place count 85 transition count 102
Applied a total of 61 rules in 29 ms. Remains 85 /135 variables (removed 50) and now considering 102/189 (removed 87) transitions.
// Phase 1: matrix 102 rows 85 cols
[2021-05-13 23:44:24] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-13 23:44:24] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 102 rows 85 cols
[2021-05-13 23:44:24] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-13 23:44:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-13 23:44:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2021-05-13 23:44:24] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 102 rows 85 cols
[2021-05-13 23:44:24] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-13 23:44:24] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/135 places, 102/189 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-00 finished in 426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 11 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:24] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:25] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:25] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:25] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:25] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:25] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s13 1), p2:(EQ s88 1), p0:(EQ s128 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 470 reset in 366 ms.
Stack based approach found an accepted trace after 89 steps with 0 reset with depth 90 and stack size 90 in 0 ms.
FORMULA NoC3x3-PT-1A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-01 finished in 823 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 6 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:25] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:25] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:25] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-13 23:44:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:25] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:25] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s126 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-02 finished in 315 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(((G(p1) U X(p2)) U ((G(p1) U X(p2))&&p3)))||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 5 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:26] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:26] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:26] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-13 23:44:26] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:26] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:26] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : NoC3x3-PT-1A-03 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p3 p1), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p0) p3 p1), acceptance={0} source=1 dest: 4}, { cond=(NOT p1), acceptance={1} source=1 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 8}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0} source=4 dest: 8}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={1} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=p1, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1} source=8 dest: 1}, { cond=p1, acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0} source=8 dest: 4}, { cond=(NOT p1), acceptance={1} source=8 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s104 0) (AND (EQ s98 1) (EQ s110 1))), p3:(AND (EQ s98 1) (EQ s110 1)), p1:(EQ s104 1), p2:(EQ s82 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 352 reset in 282 ms.
Stack based approach found an accepted trace after 83870 steps with 222 reset with depth 331 and stack size 313 in 277 ms.
FORMULA NoC3x3-PT-1A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-03 finished in 1206 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U G((X(X(p2))||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 4 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:27] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:27] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:27] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-13 23:44:27] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:27] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:27] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s48 0) (EQ s57 0)), p0:(AND (NEQ s117 0) (NEQ s126 0)), p2:(OR (NEQ s117 1) (NEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 81 reset in 255 ms.
Product exploration explored 100000 steps with 59 reset in 295 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 92 reset in 247 ms.
Product exploration explored 100000 steps with 40 reset in 301 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 4 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 131/131 places, 185/185 transitions.
Graph (trivial) has 80 edges and 131 vertex of which 42 / 131 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.
Applied a total of 1 rules in 6 ms. Remains 107 /131 variables (removed 24) and now considering 137/185 (removed 48) transitions.
[2021-05-13 23:44:29] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-13 23:44:29] [INFO ] Flow matrix only has 120 transitions (discarded 17 similar events)
// Phase 1: matrix 120 rows 107 cols
[2021-05-13 23:44:29] [INFO ] Computed 34 place invariants in 7 ms
[2021-05-13 23:44:29] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/131 places, 137/185 transitions.
Product exploration explored 100000 steps with 62 reset in 272 ms.
Product exploration explored 100000 steps with 69 reset in 315 ms.
[2021-05-13 23:44:30] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:44:30] [INFO ] Flatten gal took : 13 ms
[2021-05-13 23:44:30] [INFO ] Time to serialize gal into /tmp/LTL6629873432965594086.gal : 6 ms
[2021-05-13 23:44:30] [INFO ] Time to serialize properties into /tmp/LTL11960737393144694320.ltl : 6 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/LTL6629873432965594086.gal, -t, CGAL, -LTL, /tmp/LTL11960737393144694320.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/LTL6629873432965594086.gal -t CGAL -LTL /tmp/LTL11960737393144694320.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p148!=0)&&(p160!=0))"))U(G(("((p61==0)||(p73==0))")||(X(X("((p148!=1)||(p160!=1))"))))))))
Formula 0 simplified : !X(F"((p148!=0)&&(p160!=0))" U G("((p61==0)||(p73==0))" | XX"((p148!=1)||(p160!=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
8 unique states visited
5 strongly connected components in search stack
9 transitions explored
5 items max in DFS search stack
30 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.333506,26660,1,0,18,42271,38,1,3690,36700,59
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NoC3x3-PT-1A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property NoC3x3-PT-1A-04 finished in 3449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Graph (trivial) has 83 edges and 135 vertex of which 44 / 135 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 103 transition count 119
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 40 place count 89 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 85 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 85 transition count 115
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 61 place count 85 transition count 102
Applied a total of 61 rules in 13 ms. Remains 85 /135 variables (removed 50) and now considering 102/189 (removed 87) transitions.
// Phase 1: matrix 102 rows 85 cols
[2021-05-13 23:44:30] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-13 23:44:30] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 102 rows 85 cols
[2021-05-13 23:44:30] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-13 23:44:30] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-13 23:44:30] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2021-05-13 23:44:30] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 102 rows 85 cols
[2021-05-13 23:44:30] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-13 23:44:30] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/135 places, 102/189 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s71 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-1A-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-06 finished in 296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))&&((F(p1)&&G(F(p2)))||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 186
Applied a total of 6 rules in 3 ms. Remains 132 /135 variables (removed 3) and now considering 186/189 (removed 3) transitions.
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:31] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:31] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:31] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-13 23:44:31] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:31] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 132/135 places, 186/189 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1A-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s130 1), p2:(OR (NEQ s83 1) (NEQ s120 1)), p0:(OR (NEQ s70 1) (NEQ s82 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9405 steps with 1 reset in 24 ms.
FORMULA NoC3x3-PT-1A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-07 finished in 418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(X(F(p1))||G(!p0)||(!p0&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 3 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:31] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:31] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:31] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:31] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:31] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-13 23:44:31] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
[2021-05-13 23:44:31] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-1A-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s126 1), p2:(NEQ s59 1), p1:(NEQ s87 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]]
Product exploration explored 100000 steps with 362 reset in 251 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA NoC3x3-PT-1A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-08 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X((p1&&F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 3 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:32] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:32] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:32] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:32] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:32] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-13 23:44:32] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : NoC3x3-PT-1A-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(EQ s126 0), p2:(EQ s126 1), p1:(NEQ s16 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Product exploration explored 100000 steps with 33333 reset in 260 ms.
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Product exploration explored 100000 steps with 33333 reset in 256 ms.
Applying partial POR strategy [false, true, true, false, false, true]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Support contains 2 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 131/131 places, 185/185 transitions.
Graph (trivial) has 80 edges and 131 vertex of which 43 / 131 are part of one of the 19 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Applied a total of 1 rules in 5 ms. Remains 107 /131 variables (removed 24) and now considering 137/185 (removed 48) transitions.
[2021-05-13 23:44:33] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-13 23:44:33] [INFO ] Flow matrix only has 119 transitions (discarded 18 similar events)
// Phase 1: matrix 119 rows 107 cols
[2021-05-13 23:44:33] [INFO ] Computed 34 place invariants in 6 ms
[2021-05-13 23:44:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/131 places, 137/185 transitions.
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Product exploration explored 100000 steps with 33333 reset in 262 ms.
[2021-05-13 23:44:34] [INFO ] Flatten gal took : 12 ms
[2021-05-13 23:44:34] [INFO ] Flatten gal took : 11 ms
[2021-05-13 23:44:34] [INFO ] Time to serialize gal into /tmp/LTL3322905616526997841.gal : 2 ms
[2021-05-13 23:44:34] [INFO ] Time to serialize properties into /tmp/LTL9856790693344220922.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/LTL3322905616526997841.gal, -t, CGAL, -LTL, /tmp/LTL9856790693344220922.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/LTL3322905616526997841.gal -t CGAL -LTL /tmp/LTL9856790693344220922.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p160==0)")||(X(("(p20!=1)")&&(F("(p160==1)"))))))))
Formula 0 simplified : !XX("(p160==0)" | X("(p20!=1)" & F"(p160==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
17 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.194494,21468,1,0,7,23412,14,0,3523,29358,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-1A-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property NoC3x3-PT-1A-09 finished in 2664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Graph (trivial) has 81 edges and 135 vertex of which 45 / 135 are part of one of the 20 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 107 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 107 transition count 136
Applied a total of 7 rules in 7 ms. Remains 107 /135 variables (removed 28) and now considering 136/189 (removed 53) transitions.
[2021-05-13 23:44:34] [INFO ] Flow matrix only has 117 transitions (discarded 19 similar events)
// Phase 1: matrix 117 rows 107 cols
[2021-05-13 23:44:34] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2021-05-13 23:44:34] [INFO ] Flow matrix only has 117 transitions (discarded 19 similar events)
// Phase 1: matrix 117 rows 107 cols
[2021-05-13 23:44:34] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-13 23:44:34] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-13 23:44:34] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2021-05-13 23:44:34] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-13 23:44:34] [INFO ] Flow matrix only has 117 transitions (discarded 19 similar events)
// Phase 1: matrix 117 rows 107 cols
[2021-05-13 23:44:34] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:35] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 107/135 places, 136/189 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s105 1), p1:(OR (NEQ s11 1) (NEQ s43 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 1277 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-1A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-10 finished in 302 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((G(!p0)||((p1&&X(G(!p0))) U ((X(G(!p0))&&p2)||G((p1&&X(G(!p0))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 131 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 131 transition count 185
Applied a total of 8 rules in 2 ms. Remains 131 /135 variables (removed 4) and now considering 185/189 (removed 4) transitions.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:35] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:35] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:35] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 185 rows 131 cols
[2021-05-13 23:44:35] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:35] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/135 places, 185/189 transitions.
Stuttering acceptance computed with spot in 2578 ms :[p0, p0, (OR p0 (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-11 automaton TGBA [mat=[[{ cond=(OR (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=4, aps=[p0:(AND (EQ s96 1) (EQ s106 1)), p2:(AND (NEQ s32 1) (OR (NEQ s1 1) (NEQ s14 1))), p1:(OR (NEQ s1 1) (NEQ s14 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 241 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-11 finished in 2845 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(X(p0)))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 186
Applied a total of 6 rules in 2 ms. Remains 132 /135 variables (removed 3) and now considering 186/189 (removed 3) transitions.
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:37] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:37] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:37] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:38] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:38] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:38] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 132/135 places, 186/189 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(EQ s36 1), p1:(OR (EQ s68 0) (EQ s85 0) (EQ s22 0) (EQ s31 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 0 reset in 231 ms.
Product exploration explored 100000 steps with 0 reset in 339 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 264 ms.
Product exploration explored 100000 steps with 0 reset in 379 ms.
Applying partial POR strategy [true, false, true, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 132/132 places, 186/186 transitions.
Graph (trivial) has 77 edges and 132 vertex of which 41 / 132 are part of one of the 18 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Applied a total of 1 rules in 4 ms. Remains 109 /132 variables (removed 23) and now considering 140/186 (removed 46) transitions.
[2021-05-13 23:44:40] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 23:44:40] [INFO ] Flow matrix only has 123 transitions (discarded 17 similar events)
// Phase 1: matrix 123 rows 109 cols
[2021-05-13 23:44:40] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:40] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 109/132 places, 140/186 transitions.
Entered a terminal (fully accepting) state of product in 75288 steps with 0 reset in 236 ms.
FORMULA NoC3x3-PT-1A-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-12 finished in 2491 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||G(p1))) U G(!p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Graph (trivial) has 76 edges and 135 vertex of which 39 / 135 are part of one of the 17 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 107 transition count 128
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 34 place count 95 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 91 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 91 transition count 124
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 91 transition count 112
Applied a total of 54 rules in 9 ms. Remains 91 /135 variables (removed 44) and now considering 112/189 (removed 77) transitions.
// Phase 1: matrix 112 rows 91 cols
[2021-05-13 23:44:40] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-13 23:44:40] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 112 rows 91 cols
[2021-05-13 23:44:40] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-13 23:44:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2021-05-13 23:44:40] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2021-05-13 23:44:40] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 112 rows 91 cols
[2021-05-13 23:44:40] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-13 23:44:40] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/135 places, 112/189 transitions.
Stuttering acceptance computed with spot in 51 ms :[p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1A-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND 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:(NEQ s14 1), p0:(AND (EQ s59 0) (OR (EQ s80 0) (EQ s86 0)))], 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-14 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(((X(p1)&&F(p2))||G(p1)||p0))) U p3))], workingDir=/home/mcc/execution]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 189/189 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 186
Applied a total of 6 rules in 3 ms. Remains 132 /135 variables (removed 3) and now considering 186/189 (removed 3) transitions.
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:40] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:40] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:40] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-13 23:44:40] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 186 rows 132 cols
[2021-05-13 23:44:40] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-13 23:44:40] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 132/135 places, 186/189 transitions.
Stuttering acceptance computed with spot in 2011 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1A-15 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s129 1), p0:(OR (NEQ s12 1) (NEQ s52 1)), p1:(NEQ s110 1), p2:(NEQ s129 0)], 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 26 reset in 274 ms.
Stack based approach found an accepted trace after 7882 steps with 6 reset with depth 315 and stack size 298 in 23 ms.
FORMULA NoC3x3-PT-1A-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-15 finished in 2553 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620949484337
--------------------
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-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 r140-tall-162089127500229"
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 '
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 ;