fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654372600357
Last Updated
July 7, 2024

About the Execution of 2023-gold for NoC3x3-PT-2A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
383.731 14641.00 25778.00 529.20 FFFFFFTFFFFTFFFF normal

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.r263-tall-171654372600357.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 gold2023
Input is NoC3x3-PT-2A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372600357
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K 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 53K 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.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 07:31 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 127K 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-2A-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-2A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716689597812

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 02:13:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:13:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:13:20] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-26 02:13:20] [INFO ] Transformed 361 places.
[2024-05-26 02:13:20] [INFO ] Transformed 428 transitions.
[2024-05-26 02:13:20] [INFO ] Found NUPN structural information;
[2024-05-26 02:13:20] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-2A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 428/428 transitions.
Ensure Unique test removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 338 transition count 428
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 117 place count 244 transition count 314
Ensure Unique test removed 29 places
Iterating global reduction 1 with 123 rules applied. Total rules applied 240 place count 215 transition count 314
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 296 place count 215 transition count 258
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 316 place count 215 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 322 place count 209 transition count 238
Applied a total of 322 rules in 43 ms. Remains 209 /361 variables (removed 152) and now considering 238/428 (removed 190) transitions.
[2024-05-26 02:13:20] [INFO ] Flow matrix only has 227 transitions (discarded 11 similar events)
// Phase 1: matrix 227 rows 209 cols
[2024-05-26 02:13:20] [INFO ] Computed 69 invariants in 18 ms
[2024-05-26 02:13:20] [INFO ] Implicit Places using invariants in 237 ms returned [7, 23, 48, 60, 89, 93, 126, 132, 156, 169, 177]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 262 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/361 places, 238/428 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 310 ms. Remains : 198/361 places, 238/428 transitions.
Support contains 27 out of 198 places after structural reductions.
[2024-05-26 02:13:20] [INFO ] Flatten gal took : 49 ms
[2024-05-26 02:13:20] [INFO ] Flatten gal took : 19 ms
[2024-05-26 02:13:20] [INFO ] Input system was already deterministic with 238 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 18) seen :17
Finished Best-First random walk after 1185 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=197 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 185 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 185 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 185 transition count 215
Applied a total of 33 rules in 10 ms. Remains 185 /198 variables (removed 13) and now considering 215/238 (removed 23) transitions.
[2024-05-26 02:13:21] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 02:13:21] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:13:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-26 02:13:21] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:21] [INFO ] Invariant cache hit.
[2024-05-26 02:13:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:13:21] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-26 02:13:21] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:21] [INFO ] Invariant cache hit.
[2024-05-26 02:13:21] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 215/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 185/198 places, 215/238 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s80 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-02 finished in 785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p1||(p2 U p3)))&&X(p1))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 187 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 187 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 28 place count 187 transition count 219
Applied a total of 28 rules in 11 ms. Remains 187 /198 variables (removed 11) and now considering 219/238 (removed 19) transitions.
[2024-05-26 02:13:22] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 187 cols
[2024-05-26 02:13:22] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:13:22] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-26 02:13:22] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 02:13:22] [INFO ] Invariant cache hit.
[2024-05-26 02:13:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:13:22] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-26 02:13:22] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 02:13:22] [INFO ] Invariant cache hit.
[2024-05-26 02:13:22] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 187/198 places, 219/238 transitions.
Stuttering acceptance computed with spot in 553 ms :[(NOT p1), true, (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=0 dest: 5}, { cond=(OR (AND p1 p0) (AND p3 p0) (AND p2 p0)), acceptance={} source=0 dest: 6}, { cond=(OR (AND p1 p0) (AND p3 p0) (AND p2 p0)), acceptance={0} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 3}, { cond=(OR p1 p3 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={0} source=5 dest: 7}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=5 dest: 9}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=5 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND p3 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(OR (AND p1 p0) (AND p3 p0) (AND p2 p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) p2 (NOT p0))), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=7 dest: 5}, { cond=(OR (AND (NOT p1) p3 p0) (AND (NOT p1) p2 p0)), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p1) p3 p0) (AND (NOT p1) p2 p0)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=9 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={0} source=10 dest: 5}]], initial=0, aps=[p1:(EQ s50 1), p3:(EQ s156 1), p2:(OR (EQ s8 0) (EQ s101 1)), p0:(OR (EQ s8 0) (EQ s101 1) (EQ s157 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-03 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 196 transition count 171
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 155 place count 122 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 118 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 118 transition count 149
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 118 transition count 148
Applied a total of 164 rules in 26 ms. Remains 118 /198 variables (removed 80) and now considering 148/238 (removed 90) transitions.
// Phase 1: matrix 148 rows 118 cols
[2024-05-26 02:13:23] [INFO ] Computed 49 invariants in 1 ms
[2024-05-26 02:13:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-26 02:13:23] [INFO ] Invariant cache hit.
[2024-05-26 02:13:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:13:23] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-26 02:13:23] [INFO ] Redundant transitions in 57 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 60, 68, 69, 85, 100, 101, 103, 110, 111, 112, 118, 119, 120, 122, 126, 129, 130, 131, 132, 135, 138, 139, 140, 141, 147]
Found 33 redundant transitions using SMT.
Drop transitions removed 33 transitions
Redundant transitions reduction (with SMT) removed 33 transitions.
// Phase 1: matrix 115 rows 118 cols
[2024-05-26 02:13:23] [INFO ] Computed 49 invariants in 2 ms
[2024-05-26 02:13:23] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/198 places, 115/238 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 118 transition count 103
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 94 transition count 103
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 94 transition count 99
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 46 edges and 86 vertex of which 16 / 86 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 53 place count 78 transition count 95
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 63 place count 77 transition count 86
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 87 place count 61 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 60 transition count 77
Graph (trivial) has 37 edges and 60 vertex of which 14 / 60 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 53 transition count 77
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 97 place count 53 transition count 70
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 112 place count 53 transition count 55
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 4 with 3 rules applied. Total rules applied 115 place count 51 transition count 54
Graph (trivial) has 16 edges and 51 vertex of which 2 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 50 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 50 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 50 transition count 52
Applied a total of 118 rules in 24 ms. Remains 50 /118 variables (removed 68) and now considering 52/115 (removed 63) transitions.
// Phase 1: matrix 52 rows 50 cols
[2024-05-26 02:13:23] [INFO ] Computed 23 invariants in 0 ms
[2024-05-26 02:13:23] [INFO ] Implicit Places using invariants in 31 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/198 places, 52/238 transitions.
Applied a total of 0 rules in 5 ms. Remains 49 /49 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 348 ms. Remains : 49/198 places, 52/238 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s32 1), p0:(OR (EQ s21 0) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-04 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 197 transition count 174
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 75 rules applied. Total rules applied 139 place count 133 transition count 163
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 129 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 126 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 126 transition count 157
Applied a total of 150 rules in 20 ms. Remains 126 /198 variables (removed 72) and now considering 157/238 (removed 81) transitions.
[2024-05-26 02:13:23] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
// Phase 1: matrix 148 rows 126 cols
[2024-05-26 02:13:23] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:13:23] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-26 02:13:23] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
[2024-05-26 02:13:23] [INFO ] Invariant cache hit.
[2024-05-26 02:13:23] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-26 02:13:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-26 02:13:23] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-26 02:13:23] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
[2024-05-26 02:13:23] [INFO ] Invariant cache hit.
[2024-05-26 02:13:23] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/198 places, 157/238 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 126/198 places, 157/238 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-05 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&(!p1 U (p2||G(!p1)))))||(p0&&(!p1 U (p2||G(!p1)))&&G(F(p3))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 196 transition count 174
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 82 rules applied. Total rules applied 145 place count 127 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 147 place count 125 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 122 transition count 155
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 122 transition count 155
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 122 transition count 152
Applied a total of 156 rules in 22 ms. Remains 122 /198 variables (removed 76) and now considering 152/238 (removed 86) transitions.
// Phase 1: matrix 152 rows 122 cols
[2024-05-26 02:13:23] [INFO ] Computed 51 invariants in 1 ms
[2024-05-26 02:13:24] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-26 02:13:24] [INFO ] Invariant cache hit.
[2024-05-26 02:13:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:13:24] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-26 02:13:24] [INFO ] Redundant transitions in 51 ms returned [23, 46, 47, 75, 86, 101, 102, 104, 108, 133, 134, 137, 149, 150, 151]
Found 15 redundant transitions using SMT.
Drop transitions removed 15 transitions
Redundant transitions reduction (with SMT) removed 15 transitions.
// Phase 1: matrix 137 rows 122 cols
[2024-05-26 02:13:24] [INFO ] Computed 51 invariants in 1 ms
[2024-05-26 02:13:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 137/238 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 122 transition count 129
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 129
Drop transitions 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 27 place count 106 transition count 126
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 38 edges and 100 vertex of which 8 / 100 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 37 place count 96 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 96 transition count 119
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 56 place count 86 transition count 114
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 59 place count 84 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 34 edges and 84 vertex of which 4 / 84 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 82 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 82 transition count 109
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 71 place count 82 transition count 102
Applied a total of 71 rules in 13 ms. Remains 82 /122 variables (removed 40) and now considering 102/137 (removed 35) transitions.
[2024-05-26 02:13:24] [INFO ] Flow matrix only has 100 transitions (discarded 2 similar events)
// Phase 1: matrix 100 rows 82 cols
[2024-05-26 02:13:24] [INFO ] Computed 34 invariants in 1 ms
[2024-05-26 02:13:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-26 02:13:24] [INFO ] Flow matrix only has 100 transitions (discarded 2 similar events)
[2024-05-26 02:13:24] [INFO ] Invariant cache hit.
[2024-05-26 02:13:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-26 02:13:24] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/198 places, 102/238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 82/198 places, 102/238 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2) p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (EQ s25 0) (EQ s38 1)), p0:(NEQ s80 1), p2:(AND (NOT (OR (EQ s59 0) (EQ s49 1))) (NOT (AND (OR (EQ s59 0) (EQ s49 1)) (EQ s80 1)))), p1:(AND (OR (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-10 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 185 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 185 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 33 place count 185 transition count 215
Applied a total of 33 rules in 8 ms. Remains 185 /198 variables (removed 13) and now considering 215/238 (removed 23) transitions.
[2024-05-26 02:13:24] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 02:13:24] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:13:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-26 02:13:24] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:24] [INFO ] Invariant cache hit.
[2024-05-26 02:13:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:13:24] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-26 02:13:24] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:24] [INFO ] Invariant cache hit.
[2024-05-26 02:13:24] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 215/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 185/198 places, 215/238 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s115 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 515 ms.
Product exploration explored 100000 steps with 25000 reset in 418 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-26 02:13:26] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:26] [INFO ] Invariant cache hit.
[2024-05-26 02:13:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-26 02:13:26] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:26] [INFO ] Invariant cache hit.
[2024-05-26 02:13:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:13:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-26 02:13:26] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2024-05-26 02:13:26] [INFO ] Invariant cache hit.
[2024-05-26 02:13:26] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 185/185 places, 215/215 transitions.
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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 631 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 375 ms.
Product exploration explored 100000 steps with 25000 reset in 375 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 215/215 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 185 transition count 215
Deduced a syphon composed of 60 places in 0 ms
Applied a total of 60 rules in 9 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-26 02:13:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-26 02:13:28] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 185 cols
[2024-05-26 02:13:28] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:13:28] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/185 places, 215/215 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 185/185 places, 215/215 transitions.
Built C files in :
/tmp/ltsmin10744603842040386630
[2024-05-26 02:13:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10744603842040386630
Running compilation step : cd /tmp/ltsmin10744603842040386630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin10744603842040386630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10744603842040386630;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15759191457684813513.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-2A-LTLCardinality-11 finished in 5042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 187 transition count 225
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 187 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 187 transition count 219
Applied a total of 27 rules in 10 ms. Remains 187 /198 variables (removed 11) and now considering 219/238 (removed 19) transitions.
[2024-05-26 02:13:29] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 187 cols
[2024-05-26 02:13:29] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 02:13:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 02:13:29] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2024-05-26 02:13:29] [INFO ] Invariant cache hit.
[2024-05-26 02:13:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:13:29] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-26 02:13:29] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2024-05-26 02:13:29] [INFO ] Invariant cache hit.
[2024-05-26 02:13:29] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 187/198 places, 219/238 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s119 0) (NEQ s101 1)), p0:(OR (EQ s29 0) (EQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-12 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 187 transition count 226
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 187 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 28 place count 187 transition count 219
Applied a total of 28 rules in 7 ms. Remains 187 /198 variables (removed 11) and now considering 219/238 (removed 19) transitions.
[2024-05-26 02:13:30] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 187 cols
[2024-05-26 02:13:30] [INFO ] Computed 57 invariants in 1 ms
[2024-05-26 02:13:30] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-26 02:13:30] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 02:13:30] [INFO ] Invariant cache hit.
[2024-05-26 02:13:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-26 02:13:30] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-26 02:13:30] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2024-05-26 02:13:30] [INFO ] Invariant cache hit.
[2024-05-26 02:13:30] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 187/198 places, 219/238 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s17 0) (NEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-13 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 196 transition count 170
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 158 place count 120 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 162 place count 116 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 116 transition count 148
Applied a total of 166 rules in 14 ms. Remains 116 /198 variables (removed 82) and now considering 148/238 (removed 90) transitions.
// Phase 1: matrix 148 rows 116 cols
[2024-05-26 02:13:30] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:13:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-26 02:13:30] [INFO ] Invariant cache hit.
[2024-05-26 02:13:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:13:30] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-26 02:13:30] [INFO ] Redundant transitions in 45 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 73, 84, 99, 100, 102, 106, 109, 112, 118, 119, 120, 122, 126, 129, 130, 131, 132, 135, 138, 139, 140, 141, 147]
Found 35 redundant transitions using SMT.
Drop transitions removed 35 transitions
Redundant transitions reduction (with SMT) removed 35 transitions.
// Phase 1: matrix 113 rows 116 cols
[2024-05-26 02:13:30] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:13:30] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/198 places, 113/238 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 116 transition count 100
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 90 transition count 100
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 90 transition count 95
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 80 vertex of which 16 / 80 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 72 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 72 transition count 82
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 92 place count 56 transition count 74
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 1 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 48 transition count 74
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 101 place count 48 transition count 66
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 48 transition count 50
Applied a total of 117 rules in 10 ms. Remains 48 /116 variables (removed 68) and now considering 50/113 (removed 63) transitions.
// Phase 1: matrix 50 rows 48 cols
[2024-05-26 02:13:30] [INFO ] Computed 22 invariants in 0 ms
[2024-05-26 02:13:30] [INFO ] Implicit Places using invariants in 36 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/198 places, 50/238 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 317 ms. Remains : 47/198 places, 50/238 transitions.
Stuttering acceptance computed with spot in 83 ms :[p0, true, p0]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (EQ s22 0) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-14 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 238/238 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 196 transition count 169
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 160 place count 119 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 164 place count 115 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 168 place count 115 transition count 147
Applied a total of 168 rules in 13 ms. Remains 115 /198 variables (removed 83) and now considering 147/238 (removed 91) transitions.
// Phase 1: matrix 147 rows 115 cols
[2024-05-26 02:13:30] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:13:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-26 02:13:30] [INFO ] Invariant cache hit.
[2024-05-26 02:13:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:13:31] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-26 02:13:31] [INFO ] Redundant transitions in 50 ms returned [23, 30, 31, 44, 47, 58, 59, 60, 61, 62, 69, 70, 73, 84, 99, 100, 102, 106, 109, 110, 111, 117, 118, 119, 121, 125, 128, 129, 130, 131, 134, 137, 138, 139, 140, 146]
Found 36 redundant transitions using SMT.
Drop transitions removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions.
// Phase 1: matrix 111 rows 115 cols
[2024-05-26 02:13:31] [INFO ] Computed 48 invariants in 1 ms
[2024-05-26 02:13:31] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/198 places, 111/238 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 115 transition count 98
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 89 transition count 98
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 89 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 79 vertex of which 16 / 79 are part of one of the 8 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 71 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 71 transition count 80
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 95 place count 53 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 52 transition count 70
Graph (trivial) has 37 edges and 52 vertex of which 16 / 52 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 44 transition count 70
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 106 place count 44 transition count 62
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 123 place count 44 transition count 45
Applied a total of 123 rules in 11 ms. Remains 44 /115 variables (removed 71) and now considering 45/111 (removed 66) transitions.
// Phase 1: matrix 45 rows 44 cols
[2024-05-26 02:13:31] [INFO ] Computed 21 invariants in 0 ms
[2024-05-26 02:13:31] [INFO ] Implicit Places using invariants in 35 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/198 places, 45/238 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 45
Applied a total of 1 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-26 02:13:31] [INFO ] Computed 20 invariants in 0 ms
[2024-05-26 02:13:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-26 02:13:31] [INFO ] Invariant cache hit.
[2024-05-26 02:13:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 02:13:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/198 places, 45/238 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 398 ms. Remains : 43/198 places, 45/238 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLCardinality-15 finished in 483 ms.
All properties solved by simple procedures.
Total runtime 11292 ms.

BK_STOP 1716689612453

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-2A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is NoC3x3-PT-2A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-tall-171654372600357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2A.tgz
mv NoC3x3-PT-2A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;