Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 07:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 133K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716695533175

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-26 03:52:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:52:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:52:14] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-26 03:52:14] [INFO ] Transformed 370 places.
[2024-05-26 03:52:14] [INFO ] Transformed 450 transitions.
[2024-05-26 03:52:14] [INFO ] Found NUPN structural information;
[2024-05-26 03:52:14] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 355 transition count 449
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 114 place count 256 transition count 330
Ensure Unique test removed 36 places
Iterating global reduction 1 with 135 rules applied. Total rules applied 249 place count 220 transition count 330
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 310 place count 220 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 334 place count 220 transition count 245
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 341 place count 213 transition count 245
Applied a total of 341 rules in 57 ms. Remains 213 /370 variables (removed 157) and now considering 245/449 (removed 204) transitions.
[2024-05-26 03:52:14] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
// Phase 1: matrix 233 rows 213 cols
[2024-05-26 03:52:14] [INFO ] Computed 69 invariants in 20 ms
[2024-05-26 03:52:15] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-26 03:52:15] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
[2024-05-26 03:52:15] [INFO ] Invariant cache hit.
[2024-05-26 03:52:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-26 03:52:15] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2024-05-26 03:52:15] [INFO ] Flow matrix only has 233 transitions (discarded 12 similar events)
[2024-05-26 03:52:15] [INFO ] Invariant cache hit.
[2024-05-26 03:52:15] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 2/213 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 232/445 variables, 213/282 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 10/292 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (OVERLAPS) 1/446 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (OVERLAPS) 0/446 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 293 constraints, problems are : Problem set: 0 solved, 244 unsolved in 13422 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 213/213 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/211 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (OVERLAPS) 2/213 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 232/445 variables, 213/282 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 10/292 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 244/536 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 11 (OVERLAPS) 1/446 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 13 (OVERLAPS) 0/446 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 537 constraints, problems are : Problem set: 0 solved, 244 unsolved in 13797 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 213/213 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints]
After SMT, in 27320ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 27336ms
Starting structural reductions in LTL mode, iteration 1 : 213/370 places, 245/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27902 ms. Remains : 213/370 places, 245/449 transitions.
Support contains 52 out of 213 places after structural reductions.
[2024-05-26 03:52:42] [INFO ] Flatten gal took : 43 ms
[2024-05-26 03:52:42] [INFO ] Flatten gal took : 20 ms
[2024-05-26 03:52:42] [INFO ] Input system was already deterministic with 245 transitions.
Support contains 51 out of 213 places (down from 52) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 31296 steps (7 resets) in 1023 ms. (30 steps per ms) remains 0/28 properties
FORMULA NoC3x3-PT-3A-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U p1))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 7 places
Iterating global reduction 1 with 21 rules applied. Total rules applied 40 place count 187 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 49 place count 187 transition count 217
Applied a total of 49 rules in 8 ms. Remains 187 /213 variables (removed 26) and now considering 217/245 (removed 28) transitions.
[2024-05-26 03:52:43] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 187 cols
[2024-05-26 03:52:43] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 03:52:43] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 03:52:43] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2024-05-26 03:52:43] [INFO ] Invariant cache hit.
[2024-05-26 03:52:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:52:43] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-26 03:52:43] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2024-05-26 03:52:43] [INFO ] Invariant cache hit.
[2024-05-26 03:52:43] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/396 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 254 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7718 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 216/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 470 constraints, problems are : Problem set: 0 solved, 216 unsolved in 9789 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 17543ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 17546ms
Starting structural reductions in LTL mode, iteration 1 : 187/213 places, 217/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17765 ms. Remains : 187/213 places, 217/245 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 18072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U G((p1||G(p2)))))'
Support contains 6 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 210 transition count 197
Reduce places removed 48 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 53 rules applied. Total rules applied 102 place count 162 transition count 192
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 157 transition count 192
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 122 place count 142 transition count 172
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 144 place count 135 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 160 place count 135 transition count 156
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 167 place count 128 transition count 156
Applied a total of 167 rules in 29 ms. Remains 128 /213 variables (removed 85) and now considering 156/245 (removed 89) transitions.
[2024-05-26 03:53:01] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
// Phase 1: matrix 148 rows 128 cols
[2024-05-26 03:53:01] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 03:53:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-26 03:53:01] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 03:53:01] [INFO ] Invariant cache hit.
[2024-05-26 03:53:01] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 03:53:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-26 03:53:01] [INFO ] Redundant transitions in 4 ms returned []
Running 155 sub problems to find dead transitions.
[2024-05-26 03:53:01] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 03:53:01] [INFO ] Invariant cache hit.
[2024-05-26 03:53:01] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 147/275 variables, 128/187 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 31/218 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 219 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5450 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 147/275 variables, 128/187 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 31/218 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 155/373 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 374 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4737 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
After SMT, in 10226ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 10228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/213 places, 156/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10456 ms. Remains : 128/213 places, 156/245 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-01 finished in 10649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 39 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 188 transition count 218
Applied a total of 47 rules in 12 ms. Remains 188 /213 variables (removed 25) and now considering 218/245 (removed 27) transitions.
[2024-05-26 03:53:12] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 03:53:12] [INFO ] Computed 58 invariants in 3 ms
[2024-05-26 03:53:12] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-26 03:53:12] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 03:53:12] [INFO ] Invariant cache hit.
[2024-05-26 03:53:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:53:12] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-26 03:53:12] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 03:53:12] [INFO ] Invariant cache hit.
[2024-05-26 03:53:12] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 256 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8863 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 217/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10065 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18982ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18984ms
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19259 ms. Remains : 188/213 places, 218/245 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 486 ms.
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3A-LTLFireability-02 finished in 20309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 208 transition count 190
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 120 place count 148 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 120 place count 148 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 146 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 123 place count 146 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 144 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 144 transition count 180
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 144 place count 129 transition count 160
Ensure Unique test removed 7 places
Iterating global reduction 3 with 22 rules applied. Total rules applied 166 place count 122 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 182 place count 122 transition count 144
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 193 place count 113 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 113 transition count 141
Applied a total of 194 rules in 22 ms. Remains 113 /213 variables (removed 100) and now considering 141/245 (removed 104) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-05-26 03:53:32] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 03:53:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-26 03:53:32] [INFO ] Invariant cache hit.
[2024-05-26 03:53:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 03:53:32] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-26 03:53:32] [INFO ] Redundant transitions in 60 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 80, 93, 94, 96, 103, 104, 105, 111, 112, 113, 115, 119, 122, 123, 125, 128, 129, 130, 131, 137]
Found 32 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions.
Running 85 sub problems to find dead transitions.
// Phase 1: matrix 109 rows 113 cols
[2024-05-26 03:53:32] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 03:53:32] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 12/113 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 108/221 variables, 113/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/222 variables, and 170 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1461 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 12/113 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 108/221 variables, 113/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 85/255 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/222 variables, and 255 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1404 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 2877ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 2878ms
Starting structural reductions in SI_LTL mode, iteration 1 : 113/213 places, 109/245 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 113 transition count 98
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 91 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 91 transition count 95
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 46 edges and 85 vertex of which 16 / 85 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 46 place count 77 transition count 92
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 56 place count 76 transition count 83
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 83 place count 58 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 56 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 48 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 96 place count 48 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 99 place count 46 transition count 63
Graph (trivial) has 30 edges and 46 vertex of which 2 / 46 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 45 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 45 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 118 place count 45 transition count 45
Applied a total of 118 rules in 21 ms. Remains 45 /113 variables (removed 68) and now considering 45/109 (removed 64) transitions.
// Phase 1: matrix 45 rows 45 cols
[2024-05-26 03:53:35] [INFO ] Computed 22 invariants in 0 ms
[2024-05-26 03:53:35] [INFO ] Implicit Places using invariants in 52 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/213 places, 45/245 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3245 ms. Remains : 44/213 places, 45/245 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-03 finished in 3290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (X(G(p0))&&p1))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 20 place count 193 transition count 225
Ensure Unique test removed 7 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 42 place count 186 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 51 place count 186 transition count 216
Applied a total of 51 rules in 5 ms. Remains 186 /213 variables (removed 27) and now considering 216/245 (removed 29) transitions.
[2024-05-26 03:53:35] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2024-05-26 03:53:35] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:53:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 03:53:35] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 03:53:35] [INFO ] Invariant cache hit.
[2024-05-26 03:53:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:53:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-26 03:53:36] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 03:53:36] [INFO ] Invariant cache hit.
[2024-05-26 03:53:36] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/394 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 253 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7683 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 215/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 468 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9466 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 17180ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 17182ms
Starting structural reductions in LTL mode, iteration 1 : 186/213 places, 216/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17405 ms. Remains : 186/213 places, 216/245 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-04 finished in 17549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))||(F(p0)&&F(p1))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 195 transition count 228
Ensure Unique test removed 6 places
Iterating global reduction 1 with 19 rules applied. Total rules applied 37 place count 189 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 189 transition count 222
Applied a total of 43 rules in 5 ms. Remains 189 /213 variables (removed 24) and now considering 222/245 (removed 23) transitions.
[2024-05-26 03:53:53] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
// Phase 1: matrix 214 rows 189 cols
[2024-05-26 03:53:53] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 03:53:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-26 03:53:53] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2024-05-26 03:53:53] [INFO ] Invariant cache hit.
[2024-05-26 03:53:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-26 03:53:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-26 03:53:53] [INFO ] Flow matrix only has 214 transitions (discarded 8 similar events)
[2024-05-26 03:53:53] [INFO ] Invariant cache hit.
[2024-05-26 03:53:53] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 213/402 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 10/257 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 258 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9274 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 213/402 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 10/257 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 221/478 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/403 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/403 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 479 constraints, problems are : Problem set: 0 solved, 221 unsolved in 10143 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints]
After SMT, in 19449ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 19451ms
Starting structural reductions in LTL mode, iteration 1 : 189/213 places, 222/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19674 ms. Remains : 189/213 places, 222/245 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-05 finished in 19918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 39 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 188 transition count 218
Applied a total of 47 rules in 11 ms. Remains 188 /213 variables (removed 25) and now considering 218/245 (removed 27) transitions.
[2024-05-26 03:54:13] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 03:54:13] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 03:54:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-26 03:54:13] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 03:54:13] [INFO ] Invariant cache hit.
[2024-05-26 03:54:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:54:13] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-26 03:54:13] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 03:54:13] [INFO ] Invariant cache hit.
[2024-05-26 03:54:13] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 256 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8911 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 217/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10000 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18940ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18942ms
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19152 ms. Remains : 188/213 places, 218/245 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-06 finished in 19248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(p2)))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 210 transition count 245
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 195 transition count 225
Ensure Unique test removed 7 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 40 place count 188 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 49 place count 188 transition count 216
Applied a total of 49 rules in 8 ms. Remains 188 /213 variables (removed 25) and now considering 216/245 (removed 29) transitions.
[2024-05-26 03:54:32] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 188 cols
[2024-05-26 03:54:32] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 03:54:32] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-26 03:54:32] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 03:54:32] [INFO ] Invariant cache hit.
[2024-05-26 03:54:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:54:32] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-26 03:54:32] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2024-05-26 03:54:32] [INFO ] Invariant cache hit.
[2024-05-26 03:54:32] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 2/188 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 207/395 variables, 188/247 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 1/396 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 257 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8301 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 2/188 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 207/395 variables, 188/247 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 215/471 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 1/396 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 0/396 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 472 constraints, problems are : Problem set: 0 solved, 215 unsolved in 11085 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 19419ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 19421ms
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 216/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19633 ms. Remains : 188/213 places, 216/245 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 533 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 46 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3A-LTLFireability-07 finished in 20687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||G(p1)))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 194 transition count 226
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 39 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 188 transition count 218
Applied a total of 47 rules in 5 ms. Remains 188 /213 variables (removed 25) and now considering 218/245 (removed 27) transitions.
[2024-05-26 03:54:53] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 03:54:53] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 03:54:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-26 03:54:53] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 03:54:53] [INFO ] Invariant cache hit.
[2024-05-26 03:54:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:54:53] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-26 03:54:53] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2024-05-26 03:54:53] [INFO ] Invariant cache hit.
[2024-05-26 03:54:53] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 256 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8930 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 217/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9603 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 18569ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 18572ms
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 218/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18785 ms. Remains : 188/213 places, 218/245 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-09 finished in 18954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(!p1)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 208 transition count 193
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 156 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 109 place count 154 transition count 191
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 123 place count 140 transition count 172
Ensure Unique test removed 7 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 144 place count 133 transition count 172
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 160 place count 133 transition count 156
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 167 place count 126 transition count 156
Applied a total of 167 rules in 12 ms. Remains 126 /213 variables (removed 87) and now considering 156/245 (removed 89) transitions.
[2024-05-26 03:55:12] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
// Phase 1: matrix 148 rows 126 cols
[2024-05-26 03:55:12] [INFO ] Computed 57 invariants in 0 ms
[2024-05-26 03:55:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-26 03:55:12] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 03:55:12] [INFO ] Invariant cache hit.
[2024-05-26 03:55:12] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-26 03:55:12] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-26 03:55:12] [INFO ] Redundant transitions in 4 ms returned []
Running 155 sub problems to find dead transitions.
[2024-05-26 03:55:12] [INFO ] Flow matrix only has 148 transitions (discarded 8 similar events)
[2024-05-26 03:55:12] [INFO ] Invariant cache hit.
[2024-05-26 03:55:12] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 32/215 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 216 constraints, problems are : Problem set: 0 solved, 155 unsolved in 4059 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 126/126 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 147/273 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 32/215 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 155/370 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 371 constraints, problems are : Problem set: 0 solved, 155 unsolved in 5042 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 126/126 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
After SMT, in 9124ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 9129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/213 places, 156/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9314 ms. Remains : 126/213 places, 156/245 transitions.
Stuttering acceptance computed with spot in 106 ms :[p1, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-10
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-10 finished in 9434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(p0) U !p1)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 208 transition count 245
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 195 transition count 229
Ensure Unique test removed 7 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 188 transition count 229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 47 place count 188 transition count 220
Applied a total of 47 rules in 3 ms. Remains 188 /213 variables (removed 25) and now considering 220/245 (removed 25) transitions.
[2024-05-26 03:55:21] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
// Phase 1: matrix 210 rows 188 cols
[2024-05-26 03:55:21] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 03:55:21] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-26 03:55:21] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
[2024-05-26 03:55:21] [INFO ] Invariant cache hit.
[2024-05-26 03:55:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 03:55:21] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-26 03:55:21] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
[2024-05-26 03:55:21] [INFO ] Invariant cache hit.
[2024-05-26 03:55:21] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 209/397 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/398 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 255 constraints, problems are : Problem set: 0 solved, 219 unsolved in 7969 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 209/397 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 219/473 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 474 constraints, problems are : Problem set: 0 solved, 219 unsolved in 10034 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 18036ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 18038ms
Starting structural reductions in LTL mode, iteration 1 : 188/213 places, 220/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18245 ms. Remains : 188/213 places, 220/245 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-11 finished in 18421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(!p1&&X(F(!p0)))) U (G((!p0||(!p1&&X(F(!p0)))))||((!p0||(!p1&&X(F(!p0))))&&p2))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 208 transition count 191
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 154 transition count 191
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 141 transition count 174
Ensure Unique test removed 6 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 141 place count 135 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 155 place count 135 transition count 160
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 129 transition count 160
Applied a total of 161 rules in 17 ms. Remains 129 /213 variables (removed 84) and now considering 160/245 (removed 85) transitions.
[2024-05-26 03:55:40] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
// Phase 1: matrix 151 rows 129 cols
[2024-05-26 03:55:40] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 03:55:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-26 03:55:40] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 03:55:40] [INFO ] Invariant cache hit.
[2024-05-26 03:55:40] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 03:55:40] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-26 03:55:40] [INFO ] Redundant transitions in 2 ms returned []
Running 159 sub problems to find dead transitions.
[2024-05-26 03:55:40] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 03:55:40] [INFO ] Invariant cache hit.
[2024-05-26 03:55:40] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 150/279 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 33/220 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 221 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5605 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 150/279 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 33/220 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 159/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 380 constraints, problems are : Problem set: 0 solved, 159 unsolved in 6226 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 11854ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 11859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/213 places, 160/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12062 ms. Remains : 129/213 places, 160/245 transitions.
Stuttering acceptance computed with spot in 187 ms :[p0, true, p0]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 416 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 117 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p0, true, p0]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
[2024-05-26 03:55:53] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 03:55:53] [INFO ] Invariant cache hit.
[2024-05-26 03:55:53] [INFO ] State equation strengthened by 34 read => feed constraints.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 4/280 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[Positive P Invariants (semi-flows): 0/57 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/129 constraints, ReadFeed: 0/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 14 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, p0]
Stuttering acceptance computed with spot in 44 ms :[true, p0]
Support contains 2 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-26 03:55:53] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 03:55:53] [INFO ] Invariant cache hit.
[2024-05-26 03:55:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-26 03:55:54] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 03:55:54] [INFO ] Invariant cache hit.
[2024-05-26 03:55:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 03:55:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-26 03:55:54] [INFO ] Redundant transitions in 1 ms returned []
Running 159 sub problems to find dead transitions.
[2024-05-26 03:55:54] [INFO ] Flow matrix only has 151 transitions (discarded 9 similar events)
[2024-05-26 03:55:54] [INFO ] Invariant cache hit.
[2024-05-26 03:55:54] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 150/279 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 33/220 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 1/280 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 221 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5602 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 150/279 variables, 129/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 33/220 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 159/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/280 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 380 constraints, problems are : Problem set: 0 solved, 159 unsolved in 6126 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 11757ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 11759ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11968 ms. Remains : 129/129 places, 160/160 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, p0]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 21860 steps (5 resets) in 126 ms. (172 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, p0]
Stuttering acceptance computed with spot in 48 ms :[true, p0]
Stuttering acceptance computed with spot in 48 ms :[true, p0]
Entered a terminal (fully accepting) state of product in 1307 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-13 finished in 26371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 207 transition count 189
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 124 place count 145 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 145 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 143 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 127 place count 143 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 141 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 141 transition count 178
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 147 place count 127 transition count 160
Ensure Unique test removed 7 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 168 place count 120 transition count 160
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 184 place count 120 transition count 144
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 195 place count 111 transition count 142
Applied a total of 195 rules in 11 ms. Remains 111 /213 variables (removed 102) and now considering 142/245 (removed 103) transitions.
[2024-05-26 03:56:06] [INFO ] Flow matrix only has 141 transitions (discarded 1 similar events)
// Phase 1: matrix 141 rows 111 cols
[2024-05-26 03:56:06] [INFO ] Computed 46 invariants in 1 ms
[2024-05-26 03:56:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-26 03:56:06] [INFO ] Flow matrix only has 141 transitions (discarded 1 similar events)
[2024-05-26 03:56:06] [INFO ] Invariant cache hit.
[2024-05-26 03:56:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 03:56:06] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-26 03:56:06] [INFO ] Redundant transitions in 281 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 94, 95, 97, 101, 104, 105, 106, 112, 113, 114, 116, 120, 123, 124, 126, 129, 130, 131, 132, 138]
Found 34 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
Running 84 sub problems to find dead transitions.
[2024-05-26 03:56:06] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 111 cols
[2024-05-26 03:56:06] [INFO ] Computed 46 invariants in 1 ms
[2024-05-26 03:56:06] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 13/111 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 106/217 variables, 111/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/218 variables, and 166 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 111/111 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 13/111 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 106/217 variables, 111/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 84/250 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/218 variables, and 250 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 111/111 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 2730ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 2731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/213 places, 108/245 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 111 transition count 95
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 85 transition count 95
Drop transitions (Trivial Post-Agglo cleanup.) 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 44 place count 85 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 42 edges and 75 vertex of which 14 / 75 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 68 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 68 transition count 78
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 94 place count 50 transition count 69
Graph (trivial) has 35 edges and 50 vertex of which 18 / 50 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 41 transition count 69
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 104 place count 41 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 120 place count 41 transition count 44
Applied a total of 120 rules in 10 ms. Remains 41 /111 variables (removed 70) and now considering 44/108 (removed 64) transitions.
[2024-05-26 03:56:09] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 41 cols
[2024-05-26 03:56:09] [INFO ] Computed 19 invariants in 0 ms
[2024-05-26 03:56:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-26 03:56:09] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
[2024-05-26 03:56:09] [INFO ] Invariant cache hit.
[2024-05-26 03:56:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/213 places, 44/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3258 ms. Remains : 41/213 places, 44/245 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-14 finished in 3307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((X(X(p1))||G(p2))))))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 245/245 transitions.
Graph (complete) has 632 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 208 transition count 193
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 156 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 155 transition count 192
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 120 place count 142 transition count 174
Ensure Unique test removed 6 places
Iterating global reduction 3 with 19 rules applied. Total rules applied 139 place count 136 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 13 rules applied. Total rules applied 152 place count 136 transition count 161
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 157 place count 131 transition count 161
Applied a total of 157 rules in 19 ms. Remains 131 /213 variables (removed 82) and now considering 161/245 (removed 84) transitions.
[2024-05-26 03:56:09] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
// Phase 1: matrix 153 rows 131 cols
[2024-05-26 03:56:09] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 03:56:09] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-26 03:56:09] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
[2024-05-26 03:56:09] [INFO ] Invariant cache hit.
[2024-05-26 03:56:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-26 03:56:10] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-26 03:56:10] [INFO ] Redundant transitions in 0 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-26 03:56:10] [INFO ] Flow matrix only has 153 transitions (discarded 8 similar events)
[2024-05-26 03:56:10] [INFO ] Invariant cache hit.
[2024-05-26 03:56:10] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 152/283 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 32/221 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 1/284 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 222 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5648 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 152/283 variables, 131/189 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 32/221 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 160/381 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 1/284 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/284 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 382 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5165 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 10847ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 10849ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/213 places, 161/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11065 ms. Remains : 131/213 places, 161/245 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-15
Stuttering criterion allowed to conclude after 189 steps with 48 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-15 finished in 11238 ms.
All properties solved by simple procedures.
Total runtime 246762 ms.

BK_STOP 1716695781077

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-3A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654352000588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;