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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K 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 95K 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.5K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 07:52 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 355K 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-7A-00
FORMULA_NAME NoC3x3-PT-7A-01
FORMULA_NAME NoC3x3-PT-7A-02
FORMULA_NAME NoC3x3-PT-7A-03
FORMULA_NAME NoC3x3-PT-7A-04
FORMULA_NAME NoC3x3-PT-7A-05
FORMULA_NAME NoC3x3-PT-7A-06
FORMULA_NAME NoC3x3-PT-7A-07
FORMULA_NAME NoC3x3-PT-7A-08
FORMULA_NAME NoC3x3-PT-7A-09
FORMULA_NAME NoC3x3-PT-7A-10
FORMULA_NAME NoC3x3-PT-7A-11
FORMULA_NAME NoC3x3-PT-7A-12
FORMULA_NAME NoC3x3-PT-7A-13
FORMULA_NAME NoC3x3-PT-7A-14
FORMULA_NAME NoC3x3-PT-7A-15

=== Now, execution of the tool begins

BK_START 1620970997113

Running Version 0
[2021-05-14 05:43:18] [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 05:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 05:43:18] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2021-05-14 05:43:18] [INFO ] Transformed 801 places.
[2021-05-14 05:43:18] [INFO ] Transformed 1544 transitions.
[2021-05-14 05:43:18] [INFO ] Found NUPN structural information;
[2021-05-14 05:43:18] [INFO ] Parsed PT model containing 801 places and 1544 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 05:43:18] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 801 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 178 place count 623 transition count 1180
Ensure Unique test removed 43 places
Iterating global reduction 0 with 221 rules applied. Total rules applied 399 place count 580 transition count 1180
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 435 place count 580 transition count 1144
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 453 place count 580 transition count 1126
Applied a total of 453 rules in 99 ms. Remains 580 /801 variables (removed 221) and now considering 1126/1437 (removed 311) transitions.
[2021-05-14 05:43:18] [INFO ] Flow matrix only has 1122 transitions (discarded 4 similar events)
// Phase 1: matrix 1122 rows 580 cols
[2021-05-14 05:43:18] [INFO ] Computed 68 place invariants in 30 ms
[2021-05-14 05:43:19] [INFO ] Implicit Places using invariants in 279 ms returned [11, 80, 156, 217, 298, 377, 436, 486]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 305 ms to find 8 implicit places.
[2021-05-14 05:43:19] [INFO ] Flow matrix only has 1122 transitions (discarded 4 similar events)
// Phase 1: matrix 1122 rows 572 cols
[2021-05-14 05:43:19] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-14 05:43:19] [INFO ] Dead Transitions using invariants and state equation in 433 ms returned []
Starting structural reductions, iteration 1 : 572/801 places, 1126/1437 transitions.
Applied a total of 0 rules in 12 ms. Remains 572 /572 variables (removed 0) and now considering 1126/1126 (removed 0) transitions.
[2021-05-14 05:43:19] [INFO ] Flow matrix only has 1122 transitions (discarded 4 similar events)
// Phase 1: matrix 1122 rows 572 cols
[2021-05-14 05:43:19] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-14 05:43:20] [INFO ] Dead Transitions using invariants and state equation in 385 ms returned []
Finished structural reductions, in 2 iterations. Remains : 572/801 places, 1126/1437 transitions.
[2021-05-14 05:43:20] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 05:43:20] [INFO ] Flatten gal took : 103 ms
FORMULA NoC3x3-PT-7A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 05:43:20] [INFO ] Flatten gal took : 59 ms
[2021-05-14 05:43:20] [INFO ] Input system was already deterministic with 1126 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=165 ) properties (out of 31) seen :26
Running SMT prover for 5 properties.
[2021-05-14 05:43:21] [INFO ] Flow matrix only has 1122 transitions (discarded 4 similar events)
// Phase 1: matrix 1122 rows 572 cols
[2021-05-14 05:43:21] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-14 05:43:21] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-14 05:43:21] [INFO ] [Real]Absence check using 58 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 05:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:21] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-14 05:43:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-14 05:43:21] [INFO ] [Real]Added 16 Read/Feed constraints in 8 ms returned sat
[2021-05-14 05:43:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:43:21] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-14 05:43:21] [INFO ] [Nat]Absence check using 58 positive and 2 generalized place invariants in 8 ms returned sat
[2021-05-14 05:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:21] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-14 05:43:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2021-05-14 05:43:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
[2021-05-14 05:43:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2021-05-14 05:43:21] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2021-05-14 05:43:22] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 1 ms to minimize.
[2021-05-14 05:43:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 267 ms
[2021-05-14 05:43:22] [INFO ] Computed and/alt/rep : 1083/2748/1082 causal constraints (skipped 39 transitions) in 76 ms.
[2021-05-14 05:43:29] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2021-05-14 05:43:29] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2021-05-14 05:43:30] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2021-05-14 05:43:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2021-05-14 05:43:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2021-05-14 05:43:30] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2021-05-14 05:43:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 675 ms
[2021-05-14 05:43:30] [INFO ] Added : 741 causal constraints over 149 iterations in 8368 ms. Result :sat
[2021-05-14 05:43:30] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-14 05:43:30] [INFO ] [Real]Absence check using 58 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 05:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:30] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2021-05-14 05:43:30] [INFO ] [Real]Added 16 Read/Feed constraints in 8 ms returned sat
[2021-05-14 05:43:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:43:30] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-14 05:43:30] [INFO ] [Nat]Absence check using 58 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 05:43:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:31] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-14 05:43:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2021-05-14 05:43:31] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2021-05-14 05:43:31] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2021-05-14 05:43:31] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2021-05-14 05:43:31] [INFO ] Deduced a trap composed of 20 places in 11 ms of which 0 ms to minimize.
[2021-05-14 05:43:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 202 ms
[2021-05-14 05:43:31] [INFO ] Computed and/alt/rep : 1083/2748/1082 causal constraints (skipped 39 transitions) in 59 ms.
[2021-05-14 05:43:38] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2021-05-14 05:43:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2021-05-14 05:43:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2021-05-14 05:43:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2021-05-14 05:43:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2021-05-14 05:43:39] [INFO ] Deduced a trap composed of 17 places in 12 ms of which 0 ms to minimize.
[2021-05-14 05:43:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 626 ms
[2021-05-14 05:43:39] [INFO ] Added : 741 causal constraints over 149 iterations in 8158 ms. Result :sat
[2021-05-14 05:43:39] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-14 05:43:39] [INFO ] [Real]Absence check using 58 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 05:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:39] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-14 05:43:39] [INFO ] [Real]Added 16 Read/Feed constraints in 7 ms returned sat
[2021-05-14 05:43:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:43:39] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-14 05:43:39] [INFO ] [Nat]Absence check using 58 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 05:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:39] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-14 05:43:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2021-05-14 05:43:40] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2021-05-14 05:43:40] [INFO ] Deduced a trap composed of 20 places in 12 ms of which 0 ms to minimize.
[2021-05-14 05:43:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2021-05-14 05:43:40] [INFO ] Computed and/alt/rep : 1083/2748/1082 causal constraints (skipped 39 transitions) in 50 ms.
[2021-05-14 05:43:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2021-05-14 05:43:47] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2021-05-14 05:43:47] [INFO ] Deduced a trap composed of 20 places in 15 ms of which 0 ms to minimize.
[2021-05-14 05:43:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2021-05-14 05:43:47] [INFO ] Added : 724 causal constraints over 145 iterations in 7532 ms. Result :sat
[2021-05-14 05:43:47] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-14 05:43:47] [INFO ] [Real]Absence check using 58 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 05:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:47] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-14 05:43:47] [INFO ] [Real]Added 16 Read/Feed constraints in 6 ms returned sat
[2021-05-14 05:43:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:43:48] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-14 05:43:48] [INFO ] [Nat]Absence check using 58 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 05:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:48] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-14 05:43:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2021-05-14 05:43:48] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2021-05-14 05:43:48] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2021-05-14 05:43:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2021-05-14 05:43:48] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 0 ms to minimize.
[2021-05-14 05:43:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 216 ms
[2021-05-14 05:43:48] [INFO ] Computed and/alt/rep : 1083/2748/1082 causal constraints (skipped 39 transitions) in 51 ms.
[2021-05-14 05:43:55] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Deduced a trap composed of 17 places in 11 ms of which 0 ms to minimize.
[2021-05-14 05:43:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 883 ms
[2021-05-14 05:43:56] [INFO ] Added : 732 causal constraints over 148 iterations in 8473 ms. Result :sat
[2021-05-14 05:43:56] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2021-05-14 05:43:57] [INFO ] [Real]Absence check using 58 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-14 05:43:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:57] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-14 05:43:57] [INFO ] [Real]Added 16 Read/Feed constraints in 6 ms returned sat
[2021-05-14 05:43:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 05:43:57] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2021-05-14 05:43:57] [INFO ] [Nat]Absence check using 58 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-14 05:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 05:43:57] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-14 05:43:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2021-05-14 05:43:57] [INFO ] Deduced a trap composed of 17 places in 14 ms of which 1 ms to minimize.
[2021-05-14 05:43:57] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2021-05-14 05:43:57] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2021-05-14 05:43:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2021-05-14 05:43:57] [INFO ] Computed and/alt/rep : 1083/2748/1082 causal constraints (skipped 39 transitions) in 51 ms.
[2021-05-14 05:44:05] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2021-05-14 05:44:05] [INFO ] Deduced a trap composed of 13 places in 9 ms of which 0 ms to minimize.
[2021-05-14 05:44:05] [INFO ] Deduced a trap composed of 13 places in 13 ms of which 0 ms to minimize.
[2021-05-14 05:44:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2021-05-14 05:44:05] [INFO ] Added : 742 causal constraints over 152 iterations in 7867 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 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Graph (trivial) has 715 edges and 572 vertex of which 106 / 572 are part of one of the 9 SCC in 3 ms
Free SCC test removed 97 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 15 rules applied. Total rules applied 16 place count 473 transition count 880
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 456 transition count 878
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 450 transition count 867
Ensure Unique test removed 2 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 448 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 448 transition count 866
Performed 148 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 346 place count 300 transition count 676
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 3 with 82 rules applied. Total rules applied 428 place count 300 transition count 594
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 458 place count 285 transition count 573
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 469 place count 285 transition count 562
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 497 place count 271 transition count 570
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 502 place count 271 transition count 565
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 6 with 71 rules applied. Total rules applied 573 place count 271 transition count 494
Applied a total of 573 rules in 107 ms. Remains 271 /572 variables (removed 301) and now considering 494/1126 (removed 632) transitions.
// Phase 1: matrix 494 rows 271 cols
[2021-05-14 05:44:05] [INFO ] Computed 54 place invariants in 3 ms
[2021-05-14 05:44:05] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 494 rows 271 cols
[2021-05-14 05:44:05] [INFO ] Computed 54 place invariants in 2 ms
[2021-05-14 05:44:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 05:44:06] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2021-05-14 05:44:06] [INFO ] Redundant transitions in 141 ms returned [380, 386, 388, 389, 396, 402, 404, 408, 412, 414, 415, 417, 418, 424, 426, 428, 433, 435, 436]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions :[436, 435, 433, 428, 426, 424, 418, 417, 415, 414, 412, 408, 404, 402, 396, 389, 388, 386, 380]
// Phase 1: matrix 475 rows 271 cols
[2021-05-14 05:44:06] [INFO ] Computed 54 place invariants in 2 ms
[2021-05-14 05:44:06] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Starting structural reductions, iteration 1 : 271/572 places, 475/1126 transitions.
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 4 place count 271 transition count 471
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 267 transition count 471
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 262 transition count 466
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 260 transition count 466
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 260 transition count 465
Applied a total of 23 rules in 30 ms. Remains 260 /271 variables (removed 11) and now considering 465/475 (removed 10) transitions.
// Phase 1: matrix 465 rows 260 cols
[2021-05-14 05:44:06] [INFO ] Computed 54 place invariants in 2 ms
[2021-05-14 05:44:06] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 465 rows 260 cols
[2021-05-14 05:44:06] [INFO ] Computed 54 place invariants in 2 ms
[2021-05-14 05:44:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 05:44:06] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 260/572 places, 465/1126 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s257 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 266 steps with 0 reset in 6 ms.
FORMULA NoC3x3-PT-7A-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-00 finished in 1218 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0||G(p1)))||(p2&&X(p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 567 transition count 1117
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 12 place count 565 transition count 1117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 565 transition count 1116
Applied a total of 13 rules in 20 ms. Remains 565 /572 variables (removed 7) and now considering 1116/1126 (removed 10) transitions.
[2021-05-14 05:44:06] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 565 cols
[2021-05-14 05:44:06] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 05:44:06] [INFO ] Implicit Places using invariants in 116 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
[2021-05-14 05:44:06] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2021-05-14 05:44:06] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:44:07] [INFO ] Dead Transitions using invariants and state equation in 379 ms returned []
Starting structural reductions, iteration 1 : 564/572 places, 1116/1126 transitions.
Applied a total of 0 rules in 7 ms. Remains 564 /564 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2021-05-14 05:44:07] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2021-05-14 05:44:07] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:44:07] [INFO ] Dead Transitions using invariants and state equation in 420 ms returned []
Finished structural reductions, in 2 iterations. Remains : 564/572 places, 1116/1126 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2 (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s23 1), p2:(EQ s23 0), p1:(AND (EQ s148 1) (EQ s409 1)), p3:(EQ s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 184 reset in 495 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 1 ms.
FORMULA NoC3x3-PT-7A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-01 finished in 1569 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(p0)))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 566 transition count 1115
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 564 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 564 transition count 1114
Applied a total of 15 rules in 15 ms. Remains 564 /572 variables (removed 8) and now considering 1114/1126 (removed 12) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2021-05-14 05:44:08] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 05:44:08] [INFO ] Implicit Places using invariants in 116 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:08] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:44:08] [INFO ] Dead Transitions using invariants and state equation in 388 ms returned []
Starting structural reductions, iteration 1 : 563/572 places, 1114/1126 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:08] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:09] [INFO ] Dead Transitions using invariants and state equation in 399 ms returned []
Finished structural reductions, in 2 iterations. Remains : 563/572 places, 1114/1126 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-7A-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s536 1), p0:(EQ s308 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-02 finished in 1061 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F((p1 U (p2||G(p1)))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 567 transition count 1118
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 12 place count 565 transition count 1118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 565 transition count 1117
Applied a total of 13 rules in 17 ms. Remains 565 /572 variables (removed 7) and now considering 1117/1126 (removed 9) transitions.
[2021-05-14 05:44:09] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 565 cols
[2021-05-14 05:44:09] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 05:44:09] [INFO ] Implicit Places using invariants in 114 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
[2021-05-14 05:44:09] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2021-05-14 05:44:09] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:44:09] [INFO ] Dead Transitions using invariants and state equation in 376 ms returned []
Starting structural reductions, iteration 1 : 564/572 places, 1117/1126 transitions.
Applied a total of 0 rules in 7 ms. Remains 564 /564 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
[2021-05-14 05:44:09] [INFO ] Flow matrix only has 1115 transitions (discarded 2 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2021-05-14 05:44:09] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:10] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 2 iterations. Remains : 564/572 places, 1117/1126 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s65 1) (EQ s90 1)), p2:(AND (OR (NEQ s473 1) (NEQ s525 1)) (OR (NEQ s65 1) (NEQ s90 1))), p1:(OR (NEQ s65 1) (NEQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-03 finished in 1033 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((F(p1)||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 567 transition count 1116
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 566 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 566 transition count 1115
Applied a total of 12 rules in 15 ms. Remains 566 /572 variables (removed 6) and now considering 1115/1126 (removed 11) transitions.
// Phase 1: matrix 1115 rows 566 cols
[2021-05-14 05:44:10] [INFO ] Computed 59 place invariants in 3 ms
[2021-05-14 05:44:10] [INFO ] Implicit Places using invariants in 115 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
// Phase 1: matrix 1115 rows 565 cols
[2021-05-14 05:44:10] [INFO ] Computed 58 place invariants in 3 ms
[2021-05-14 05:44:10] [INFO ] Dead Transitions using invariants and state equation in 380 ms returned []
Starting structural reductions, iteration 1 : 565/572 places, 1115/1126 transitions.
Applied a total of 0 rules in 7 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
// Phase 1: matrix 1115 rows 565 cols
[2021-05-14 05:44:11] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 05:44:11] [INFO ] Dead Transitions using invariants and state equation in 385 ms returned []
Finished structural reductions, in 2 iterations. Remains : 565/572 places, 1115/1126 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(NEQ s413 0), p0:(AND (EQ s528 1) (EQ s536 1)), p2:(NEQ s136 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][false, false, false, false]]
Product exploration explored 100000 steps with 165 reset in 394 ms.
Stack based approach found an accepted trace after 265 steps with 0 reset with depth 266 and stack size 264 in 1 ms.
FORMULA NoC3x3-PT-7A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-04 finished in 1398 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 566 transition count 1115
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 564 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 564 transition count 1114
Applied a total of 15 rules in 15 ms. Remains 564 /572 variables (removed 8) and now considering 1114/1126 (removed 12) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2021-05-14 05:44:11] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 05:44:12] [INFO ] Implicit Places using invariants in 114 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:12] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:12] [INFO ] Dead Transitions using invariants and state equation in 377 ms returned []
Starting structural reductions, iteration 1 : 563/572 places, 1114/1126 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:12] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:12] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
Finished structural reductions, in 2 iterations. Remains : 563/572 places, 1114/1126 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-05 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s122 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 889 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-7A-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-05 finished in 992 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(((G(p2)&&p1) U p3)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 572 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 566 transition count 1115
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 564 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 564 transition count 1114
Applied a total of 15 rules in 16 ms. Remains 564 /572 variables (removed 8) and now considering 1114/1126 (removed 12) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2021-05-14 05:44:12] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-14 05:44:13] [INFO ] Implicit Places using invariants in 118 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:13] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:13] [INFO ] Dead Transitions using invariants and state equation in 393 ms returned []
Starting structural reductions, iteration 1 : 563/572 places, 1114/1126 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:13] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:44:13] [INFO ] Dead Transitions using invariants and state equation in 387 ms returned []
Finished structural reductions, in 2 iterations. Remains : 563/572 places, 1114/1126 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7A-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s64 1) (EQ s118 1)), p3:(AND (OR (NEQ s64 1) (NEQ s118 1)) (NEQ s400 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1211 ms.
Product exploration explored 100000 steps with 50000 reset in 1220 ms.
Knowledge obtained : [(NOT p0), p3]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 50000 reset in 1191 ms.
Product exploration explored 100000 steps with 50000 reset in 1218 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 3 out of 563 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 563/563 places, 1114/1114 transitions.
Graph (trivial) has 711 edges and 563 vertex of which 106 / 563 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 466 transition count 883
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 161 places in 0 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 162 place count 466 transition count 951
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 285 place count 466 transition count 828
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 318 place count 433 transition count 786
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 351 place count 433 transition count 786
Performed 28 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 379 place count 433 transition count 858
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 416 place count 433 transition count 821
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 456 place count 393 transition count 735
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 3 with 40 rules applied. Total rules applied 496 place count 393 transition count 735
Deduced a syphon composed of 116 places in 0 ms
Drop transitions removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 3 with 87 rules applied. Total rules applied 583 place count 393 transition count 648
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 586 place count 390 transition count 642
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 589 place count 390 transition count 642
Deduced a syphon composed of 113 places in 0 ms
Applied a total of 589 rules in 97 ms. Remains 390 /563 variables (removed 173) and now considering 642/1114 (removed 472) transitions.
[2021-05-14 05:44:19] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-14 05:44:19] [INFO ] Flow matrix only has 634 transitions (discarded 8 similar events)
// Phase 1: matrix 634 rows 390 cols
[2021-05-14 05:44:19] [INFO ] Computed 57 place invariants in 1 ms
[2021-05-14 05:44:19] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 390/563 places, 642/1114 transitions.
Product exploration explored 100000 steps with 50000 reset in 3326 ms.
Product exploration explored 100000 steps with 50000 reset in 3254 ms.
Starting structural reductions, iteration 0 : 563/563 places, 1114/1114 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:25] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:26] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:26] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 05:44:26] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:44:26] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:26] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 563/563 places, 1114/1114 transitions.
[2021-05-14 05:44:26] [INFO ] Flatten gal took : 53 ms
[2021-05-14 05:44:26] [INFO ] Flatten gal took : 54 ms
[2021-05-14 05:44:26] [INFO ] Time to serialize gal into /tmp/LTL13783963224479663113.gal : 19 ms
[2021-05-14 05:44:26] [INFO ] Time to serialize properties into /tmp/LTL3816922907043566548.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/LTL13783963224479663113.gal, -t, CGAL, -LTL, /tmp/LTL3816922907043566548.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/LTL13783963224479663113.gal -t CGAL -LTL /tmp/LTL3816922907043566548.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 6 LTL properties
Checking formula 0 : !((F(("((p73==1)&&(p144==1))")||(X((("((p89==1)&&(p129==1))")&&(G("(p537==0)")))U("(((p73!=1)||(p144!=1))&&(p537!=1))"))))))
Formula 0 simplified : !F("((p73==1)&&(p144==1))" | X(("((p89==1)&&(p129==1))" & G"(p537==0)") U "(((p73!=1)||(p144!=1))&&(p537!=1))"))
Detected timeout of ITS tools.
[2021-05-14 05:44:42] [INFO ] Flatten gal took : 45 ms
[2021-05-14 05:44:42] [INFO ] Applying decomposition
[2021-05-14 05:44:42] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16111688530346441928.txt, -o, /tmp/graph16111688530346441928.bin, -w, /tmp/graph16111688530346441928.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16111688530346441928.bin, -l, -1, -v, -w, /tmp/graph16111688530346441928.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 05:44:42] [INFO ] Decomposing Gal with order
[2021-05-14 05:44:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:44:42] [INFO ] Removed a total of 593 redundant transitions.
[2021-05-14 05:44:42] [INFO ] Flatten gal took : 100 ms
[2021-05-14 05:44:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 20 ms.
[2021-05-14 05:44:42] [INFO ] Time to serialize gal into /tmp/LTL3914105462873398192.gal : 13 ms
[2021-05-14 05:44:42] [INFO ] Time to serialize properties into /tmp/LTL17169763665309541212.ltl : 1 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/LTL3914105462873398192.gal, -t, CGAL, -LTL, /tmp/LTL17169763665309541212.ltl, -c, -stutter-deadlock], 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/LTL3914105462873398192.gal -t CGAL -LTL /tmp/LTL17169763665309541212.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !((F(("((i3.u14.p73==1)&&(i3.u24.p144==1))")||(X((("((i2.u16.p89==1)&&(i2.u22.p129==1))")&&(G("(i8.u88.p537==0)")))U("(((i3.u14.p73!=1)||(i3.u24.p144!=1))&&(i8.u88.p537!=1))"))))))
Formula 0 simplified : !F("((i3.u14.p73==1)&&(i3.u24.p144==1))" | X(("((i2.u16.p89==1)&&(i2.u22.p129==1))" & G"(i8.u88.p537==0)") U "(((i3.u14.p73!=1)||(i3.u24.p144!=1))&&(i8.u88.p537!=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
202 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,2.09653,79516,1,0,130619,1885,5582,227741,709,10039,23003
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA NoC3x3-PT-7A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G(F("(i3.u24.p144==0)")))&&(F("(((i3.u28.p158!=1)||(i1.u0.p4!=1))||(i1.u6.p38!=1))")))))
Formula 1 simplified : !X(GF"(i3.u24.p144==0)" & F"(((i3.u28.p158!=1)||(i1.u0.p4!=1))||(i1.u6.p38!=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
136 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,3.45402,89076,1,0,150073,2769,7170,263733,836,12175,386440
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA NoC3x3-PT-7A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((("(i10.u111.p682==1)")U("(i6.u49.p281==1)"))||(G("(i8.u88.p538==0)")))||(X(F("(i4.u42.p233==1)")))))
Formula 2 simplified : !(("(i10.u111.p682==1)" U "(i6.u49.p281==1)") | G"(i8.u88.p538==0)" | XF"(i4.u42.p233==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15007511860197380480
[2021-05-14 05:44:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15007511860197380480
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15007511860197380480]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15007511860197380480] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15007511860197380480] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-7A-06 finished in 45583 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||G(p2)||X(F(p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 567 transition count 1117
Ensure Unique test removed 2 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 12 place count 565 transition count 1117
Applied a total of 12 rules in 14 ms. Remains 565 /572 variables (removed 7) and now considering 1117/1126 (removed 9) transitions.
// Phase 1: matrix 1117 rows 565 cols
[2021-05-14 05:44:58] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 05:44:58] [INFO ] Implicit Places using invariants in 139 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
// Phase 1: matrix 1117 rows 564 cols
[2021-05-14 05:44:58] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:44:58] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Starting structural reductions, iteration 1 : 564/572 places, 1117/1126 transitions.
Applied a total of 0 rules in 6 ms. Remains 564 /564 variables (removed 0) and now considering 1117/1117 (removed 0) transitions.
// Phase 1: matrix 1117 rows 564 cols
[2021-05-14 05:44:59] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:44:59] [INFO ] Dead Transitions using invariants and state equation in 383 ms returned []
Finished structural reductions, in 2 iterations. Remains : 564/572 places, 1117/1126 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7A-08 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p3:(EQ s187 1), p1:(EQ s218 1), p0:(EQ s490 1), p2:(EQ s401 0)], 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 206 reset in 379 ms.
Stack based approach found an accepted trace after 5372 steps with 11 reset with depth 187 and stack size 186 in 22 ms.
FORMULA NoC3x3-PT-7A-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-08 finished in 1466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Graph (trivial) has 711 edges and 572 vertex of which 106 / 572 are part of one of the 9 SCC in 0 ms
Free SCC test removed 97 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 15 rules applied. Total rules applied 16 place count 473 transition count 880
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 456 transition count 878
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 450 transition count 867
Ensure Unique test removed 2 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 49 place count 448 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 448 transition count 866
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 344 place count 301 transition count 677
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 424 place count 301 transition count 597
Performed 14 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 452 place count 287 transition count 577
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 462 place count 287 transition count 567
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 490 place count 273 transition count 574
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 497 place count 273 transition count 567
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 6 with 68 rules applied. Total rules applied 565 place count 273 transition count 499
Applied a total of 565 rules in 53 ms. Remains 273 /572 variables (removed 299) and now considering 499/1126 (removed 627) transitions.
// Phase 1: matrix 499 rows 273 cols
[2021-05-14 05:44:59] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-14 05:45:00] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 499 rows 273 cols
[2021-05-14 05:45:00] [INFO ] Computed 54 place invariants in 0 ms
[2021-05-14 05:45:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 05:45:00] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2021-05-14 05:45:00] [INFO ] Redundant transitions in 91 ms returned [384, 390, 392, 393, 400, 406, 408, 412, 416, 418, 419, 421, 422, 428, 430, 432, 437, 439, 440]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions :[440, 439, 437, 432, 430, 428, 422, 421, 419, 418, 416, 412, 408, 406, 400, 393, 392, 390, 384]
// Phase 1: matrix 480 rows 273 cols
[2021-05-14 05:45:00] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-14 05:45:00] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
Starting structural reductions, iteration 1 : 273/572 places, 480/1126 transitions.
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 5 place count 273 transition count 475
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 268 transition count 475
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 264 transition count 471
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 262 transition count 471
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 262 transition count 469
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 262 transition count 469
Applied a total of 26 rules in 49 ms. Remains 262 /273 variables (removed 11) and now considering 469/480 (removed 11) transitions.
// Phase 1: matrix 469 rows 262 cols
[2021-05-14 05:45:00] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-14 05:45:00] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 469 rows 262 cols
[2021-05-14 05:45:00] [INFO ] Computed 54 place invariants in 1 ms
[2021-05-14 05:45:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-14 05:45:00] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 262/572 places, 469/1126 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s247 0) (EQ s56 0))], 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 184 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-10 finished in 990 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&(p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 566 transition count 1115
Ensure Unique test removed 2 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 564 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 564 transition count 1114
Applied a total of 15 rules in 12 ms. Remains 564 /572 variables (removed 8) and now considering 1114/1126 (removed 12) transitions.
// Phase 1: matrix 1114 rows 564 cols
[2021-05-14 05:45:00] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 05:45:01] [INFO ] Implicit Places using invariants in 116 ms returned [530]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:45:01] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:45:01] [INFO ] Dead Transitions using invariants and state equation in 398 ms returned []
Starting structural reductions, iteration 1 : 563/572 places, 1114/1126 transitions.
Applied a total of 0 rules in 6 ms. Remains 563 /563 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2021-05-14 05:45:01] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:45:01] [INFO ] Dead Transitions using invariants and state equation in 382 ms returned []
Finished structural reductions, in 2 iterations. Remains : 563/572 places, 1114/1126 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NoC3x3-PT-7A-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s355 1), p2:(AND (NEQ s176 0) (OR (NEQ s149 1) (NEQ s171 1))), p1:(OR (NEQ s149 1) (NEQ s171 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-11 finished in 1025 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((G(p0) U p1) U G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 572 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 572/572 places, 1126/1126 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 567 transition count 1116
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 566 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 566 transition count 1115
Applied a total of 12 rules in 12 ms. Remains 566 /572 variables (removed 6) and now considering 1115/1126 (removed 11) transitions.
// Phase 1: matrix 1115 rows 566 cols
[2021-05-14 05:45:01] [INFO ] Computed 59 place invariants in 2 ms
[2021-05-14 05:45:02] [INFO ] Implicit Places using invariants in 112 ms returned [531]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
// Phase 1: matrix 1115 rows 565 cols
[2021-05-14 05:45:02] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 05:45:02] [INFO ] Dead Transitions using invariants and state equation in 401 ms returned []
Starting structural reductions, iteration 1 : 565/572 places, 1115/1126 transitions.
Applied a total of 0 rules in 6 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
// Phase 1: matrix 1115 rows 565 cols
[2021-05-14 05:45:02] [INFO ] Computed 58 place invariants in 2 ms
[2021-05-14 05:45:02] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 2 iterations. Remains : 565/572 places, 1115/1126 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-7A-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s196 1), p1:(OR (EQ s196 1) (AND (EQ s528 1) (EQ s542 1))), p0:(AND (EQ s528 1) (EQ s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, 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-7A-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-14 finished in 1081 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620971104130

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

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