Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538100324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is NoC3x3-PT-7A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 355K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678767240873

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 04:14:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 04:14:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 04:14:04] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-14 04:14:04] [INFO ] Transformed 801 places.
[2023-03-14 04:14:04] [INFO ] Transformed 1544 transitions.
[2023-03-14 04:14:04] [INFO ] Found NUPN structural information;
[2023-03-14 04:14:04] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
Support contains 59 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 631 transition count 1190
Ensure Unique test removed 39 places
Iterating global reduction 0 with 209 rules applied. Total rules applied 379 place count 592 transition count 1190
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 415 place count 592 transition count 1154
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 1 with 19 rules applied. Total rules applied 434 place count 592 transition count 1135
Applied a total of 434 rules in 146 ms. Remains 592 /801 variables (removed 209) and now considering 1135/1437 (removed 302) transitions.
[2023-03-14 04:14:05] [INFO ] Flow matrix only has 1130 transitions (discarded 5 similar events)
// Phase 1: matrix 1130 rows 592 cols
[2023-03-14 04:14:05] [INFO ] Computed 72 place invariants in 48 ms
[2023-03-14 04:14:05] [INFO ] Implicit Places using invariants in 603 ms returned [10, 79, 155, 219, 302, 384, 446, 499, 556]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 644 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 583/801 places, 1135/1437 transitions.
Applied a total of 0 rules in 12 ms. Remains 583 /583 variables (removed 0) and now considering 1135/1135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 803 ms. Remains : 583/801 places, 1135/1437 transitions.
Support contains 59 out of 583 places after structural reductions.
[2023-03-14 04:14:06] [INFO ] Flatten gal took : 254 ms
[2023-03-14 04:14:06] [INFO ] Flatten gal took : 156 ms
[2023-03-14 04:14:06] [INFO ] Input system was already deterministic with 1135 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 843 ms. (steps per millisecond=11 ) properties (out of 39) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-14 04:14:07] [INFO ] Flow matrix only has 1130 transitions (discarded 5 similar events)
// Phase 1: matrix 1130 rows 583 cols
[2023-03-14 04:14:07] [INFO ] Computed 63 place invariants in 13 ms
[2023-03-14 04:14:08] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 04:14:08] [INFO ] [Real]Absence check using 57 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-14 04:14:08] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 04:14:08] [INFO ] [Nat]Absence check using 57 positive place invariants in 29 ms returned sat
[2023-03-14 04:14:08] [INFO ] [Nat]Absence check using 57 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-14 04:14:09] [INFO ] After 773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 04:14:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:09] [INFO ] After 415ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-14 04:14:10] [INFO ] After 1175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-03-14 04:14:10] [INFO ] After 2682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 245 ms.
Support contains 15 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 709 edges and 583 vertex of which 100 / 583 are part of one of the 9 SCC in 9 ms
Free SCC test removed 91 places
Drop transitions removed 180 transitions
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 223 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 492 transition count 899
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 479 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 478 transition count 897
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 39 place count 469 transition count 883
Ensure Unique test removed 2 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 50 place count 467 transition count 883
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 467 transition count 881
Performed 146 Post agglomeration using F-continuation condition with reduction of 41 identical transitions.
Deduced a syphon composed of 146 places in 12 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 344 place count 321 transition count 694
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 4 with 85 rules applied. Total rules applied 429 place count 321 transition count 609
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 459 place count 306 transition count 588
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 470 place count 306 transition count 577
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 500 place count 291 transition count 585
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 505 place count 291 transition count 580
Drop transitions removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 7 with 67 rules applied. Total rules applied 572 place count 291 transition count 513
Free-agglomeration rule applied 41 times with reduction of 22 identical transitions.
Iterating global reduction 7 with 41 rules applied. Total rules applied 613 place count 291 transition count 450
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 682 place count 250 transition count 422
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 692 place count 250 transition count 412
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 695 place count 250 transition count 409
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 701 place count 247 transition count 406
Free-agglomeration rule (complex) applied 15 times with reduction of 2 identical transitions.
Iterating global reduction 9 with 15 rules applied. Total rules applied 716 place count 247 transition count 443
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 738 place count 232 transition count 436
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 10 with 33 rules applied. Total rules applied 771 place count 232 transition count 403
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 10 with 34 rules applied. Total rules applied 805 place count 232 transition count 403
Applied a total of 805 rules in 364 ms. Remains 232 /583 variables (removed 351) and now considering 403/1135 (removed 732) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 232/583 places, 403/1135 transitions.
Finished random walk after 5632 steps, including 1 resets, run visited all 7 properties in 51 ms. (steps per millisecond=110 )
FORMULA NoC3x3-PT-7A-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(G(!p1)||(!p1&&F(G(p2)))))))'
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 570 transition count 1116
Ensure Unique test removed 5 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 565 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 565 transition count 1115
Applied a total of 32 rules in 42 ms. Remains 565 /583 variables (removed 18) and now considering 1115/1135 (removed 20) transitions.
// Phase 1: matrix 1115 rows 565 cols
[2023-03-14 04:14:12] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-14 04:14:12] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-14 04:14:12] [INFO ] Invariant cache hit.
[2023-03-14 04:14:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:13] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1250 ms to find 0 implicit places.
[2023-03-14 04:14:13] [INFO ] Invariant cache hit.
[2023-03-14 04:14:14] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 565/583 places, 1115/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2443 ms. Remains : 565/583 places, 1115/1135 transitions.
Stuttering acceptance computed with spot in 672 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s528 1) (EQ s531 1)), p0:(OR (EQ s281 0) (EQ s341 0)), p2:(EQ s548 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 847 ms.
Product exploration explored 100000 steps with 0 reset in 677 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 : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 04:14:17] [INFO ] Invariant cache hit.
[2023-03-14 04:14:17] [INFO ] [Real]Absence check using 57 positive place invariants in 33 ms returned sat
[2023-03-14 04:14:17] [INFO ] [Real]Absence check using 57 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-14 04:14:18] [INFO ] After 591ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 04:14:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:18] [INFO ] After 57ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 04:14:18] [INFO ] After 878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 04:14:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 38 ms returned sat
[2023-03-14 04:14:18] [INFO ] [Nat]Absence check using 57 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 04:14:19] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 04:14:19] [INFO ] After 58ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 04:14:19] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-14 04:14:19] [INFO ] After 1092ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 181 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F p1)]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 533 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 565 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 1115/1115 transitions.
Applied a total of 0 rules in 14 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
[2023-03-14 04:14:20] [INFO ] Invariant cache hit.
[2023-03-14 04:14:20] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-14 04:14:20] [INFO ] Invariant cache hit.
[2023-03-14 04:14:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:21] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-14 04:14:21] [INFO ] Invariant cache hit.
[2023-03-14 04:14:22] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2176 ms. Remains : 565/565 places, 1115/1115 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 : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 04:14:23] [INFO ] Invariant cache hit.
[2023-03-14 04:14:23] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 04:14:23] [INFO ] [Real]Absence check using 57 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 04:14:24] [INFO ] After 571ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 04:14:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:24] [INFO ] After 65ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 04:14:24] [INFO ] After 816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 04:14:24] [INFO ] [Nat]Absence check using 57 positive place invariants in 30 ms returned sat
[2023-03-14 04:14:24] [INFO ] [Nat]Absence check using 57 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 04:14:25] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 04:14:25] [INFO ] After 58ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 04:14:25] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-14 04:14:25] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 122 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F p1)]
Knowledge based reduction with 6 factoid took 467 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 679 ms.
Product exploration explored 100000 steps with 0 reset in 582 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 565/565 places, 1115/1115 transitions.
Graph (trivial) has 711 edges and 565 vertex of which 106 / 565 are part of one of the 9 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 468 transition count 884
Performed 146 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 146 rules applied. Total rules applied 161 place count 468 transition count 952
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 284 place count 468 transition count 829
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 317 place count 435 transition count 787
Deduced a syphon composed of 127 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 350 place count 435 transition count 787
Performed 29 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 379 place count 435 transition count 862
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 416 place count 435 transition count 825
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 457 place count 394 transition count 737
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 3 with 41 rules applied. Total rules applied 498 place count 394 transition count 737
Deduced a syphon composed of 115 places in 0 ms
Drop transitions removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 3 with 91 rules applied. Total rules applied 589 place count 394 transition count 646
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 592 place count 391 transition count 640
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 595 place count 391 transition count 640
Deduced a syphon composed of 112 places in 0 ms
Applied a total of 595 rules in 159 ms. Remains 391 /565 variables (removed 174) and now considering 640/1115 (removed 475) transitions.
[2023-03-14 04:14:28] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-14 04:14:28] [INFO ] Flow matrix only has 632 transitions (discarded 8 similar events)
// Phase 1: matrix 632 rows 391 cols
[2023-03-14 04:14:28] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 04:14:29] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 391/565 places, 640/1115 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 813 ms. Remains : 391/565 places, 640/1115 transitions.
Support contains 5 out of 565 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 1115/1115 transitions.
Applied a total of 0 rules in 16 ms. Remains 565 /565 variables (removed 0) and now considering 1115/1115 (removed 0) transitions.
// Phase 1: matrix 1115 rows 565 cols
[2023-03-14 04:14:29] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 04:14:29] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-14 04:14:29] [INFO ] Invariant cache hit.
[2023-03-14 04:14:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:30] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-03-14 04:14:30] [INFO ] Invariant cache hit.
[2023-03-14 04:14:31] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2150 ms. Remains : 565/565 places, 1115/1115 transitions.
Treatment of property NoC3x3-PT-7A-LTLFireability-00 finished in 19356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 717 edges and 583 vertex of which 98 / 583 are part of one of the 8 SCC in 1 ms
Free SCC test removed 90 places
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 493 transition count 912
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 482 transition count 912
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 36 place count 469 transition count 893
Ensure Unique test removed 6 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 55 place count 463 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 463 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 462 transition count 889
Performed 151 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 4 with 302 rules applied. Total rules applied 362 place count 311 transition count 696
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 444 place count 311 transition count 614
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 474 place count 296 transition count 593
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 485 place count 296 transition count 582
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 513 place count 282 transition count 590
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 518 place count 282 transition count 585
Drop transitions removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 7 with 67 rules applied. Total rules applied 585 place count 282 transition count 518
Applied a total of 585 rules in 125 ms. Remains 282 /583 variables (removed 301) and now considering 518/1135 (removed 617) transitions.
[2023-03-14 04:14:31] [INFO ] Flow matrix only has 511 transitions (discarded 7 similar events)
// Phase 1: matrix 511 rows 282 cols
[2023-03-14 04:14:31] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 04:14:31] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-14 04:14:31] [INFO ] Flow matrix only has 511 transitions (discarded 7 similar events)
[2023-03-14 04:14:31] [INFO ] Invariant cache hit.
[2023-03-14 04:14:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-14 04:14:32] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-14 04:14:32] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 04:14:32] [INFO ] Flow matrix only has 511 transitions (discarded 7 similar events)
[2023-03-14 04:14:32] [INFO ] Invariant cache hit.
[2023-03-14 04:14:32] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/583 places, 518/1135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1296 ms. Remains : 282/583 places, 518/1135 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-01 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:(OR (EQ s139 0) (EQ s192 0) (AND (EQ s137 1) (EQ s179 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 4 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-01 finished in 1429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X((X(!p0)||G((!p1&&X((F(!p2)||G(!p1)))))))) U p3))'
Support contains 6 out of 583 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 572 transition count 1120
Ensure Unique test removed 4 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 26 place count 568 transition count 1120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 568 transition count 1119
Applied a total of 27 rules in 36 ms. Remains 568 /583 variables (removed 15) and now considering 1119/1135 (removed 16) transitions.
[2023-03-14 04:14:32] [INFO ] Flow matrix only has 1117 transitions (discarded 2 similar events)
// Phase 1: matrix 1117 rows 568 cols
[2023-03-14 04:14:32] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-14 04:14:33] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-14 04:14:33] [INFO ] Flow matrix only has 1117 transitions (discarded 2 similar events)
[2023-03-14 04:14:33] [INFO ] Invariant cache hit.
[2023-03-14 04:14:33] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:34] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2023-03-14 04:14:34] [INFO ] Flow matrix only has 1117 transitions (discarded 2 similar events)
[2023-03-14 04:14:34] [INFO ] Invariant cache hit.
[2023-03-14 04:14:35] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 568/583 places, 1119/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2347 ms. Remains : 568/583 places, 1119/1135 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p3), (AND p0 p1), p0, (AND p1 p0), true, p1]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s475 1) (EQ s515 1)), p0:(AND (EQ s531 1) (EQ s545 1)), p1:(AND (EQ s426 1) (EQ s457 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 31771 steps with 7 reset in 267 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-02 finished in 2866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||(!p1&&F(p2)&&X((!p1 U (p3||G(!p1)))))))))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 570 transition count 1116
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 32 place count 564 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 564 transition count 1115
Applied a total of 33 rules in 26 ms. Remains 564 /583 variables (removed 19) and now considering 1115/1135 (removed 20) transitions.
// Phase 1: matrix 1115 rows 564 cols
[2023-03-14 04:14:35] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 04:14:36] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-14 04:14:36] [INFO ] Invariant cache hit.
[2023-03-14 04:14:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:37] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2023-03-14 04:14:37] [INFO ] Invariant cache hit.
[2023-03-14 04:14:38] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 564/583 places, 1115/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2522 ms. Remains : 564/583 places, 1115/1135 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, (NOT p0), (NOT p2), (AND p1 p0 (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s211 1)), p0:(EQ s419 1), p2:(EQ s419 0), p3:(NEQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84748 steps with 21208 reset in 1243 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-03 finished in 4100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 569 transition count 1115
Ensure Unique test removed 6 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 34 place count 563 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 563 transition count 1114
Applied a total of 35 rules in 17 ms. Remains 563 /583 variables (removed 20) and now considering 1114/1135 (removed 21) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2023-03-14 04:14:39] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 04:14:40] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-14 04:14:40] [INFO ] Invariant cache hit.
[2023-03-14 04:14:40] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:40] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-14 04:14:40] [INFO ] Invariant cache hit.
[2023-03-14 04:14:42] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 563/583 places, 1114/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2245 ms. Remains : 563/583 places, 1114/1135 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-04 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:(NEQ s495 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 118 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-04 finished in 2357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F((G(p2)&&p1)))))'
Support contains 6 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 570 transition count 1116
Ensure Unique test removed 5 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 565 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 565 transition count 1115
Applied a total of 32 rules in 22 ms. Remains 565 /583 variables (removed 18) and now considering 1115/1135 (removed 20) transitions.
// Phase 1: matrix 1115 rows 565 cols
[2023-03-14 04:14:42] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-14 04:14:42] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-14 04:14:42] [INFO ] Invariant cache hit.
[2023-03-14 04:14:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:43] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-14 04:14:43] [INFO ] Invariant cache hit.
[2023-03-14 04:14:44] [INFO ] Dead Transitions using invariants and state equation in 1260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 565/583 places, 1115/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2421 ms. Remains : 565/583 places, 1115/1135 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s289 1) (EQ s309 1)), p2:(AND (EQ s425 1) (EQ s460 1) (EQ s53 1)), p0:(EQ s484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 625 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-05 finished in 3311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&((F(p1) U p2)||G(p1)))))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 705 edges and 583 vertex of which 96 / 583 are part of one of the 9 SCC in 1 ms
Free SCC test removed 87 places
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 496 transition count 921
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 485 transition count 920
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 484 transition count 920
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 39 place count 470 transition count 900
Ensure Unique test removed 6 places
Iterating global reduction 3 with 20 rules applied. Total rules applied 59 place count 464 transition count 900
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 464 transition count 896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 463 transition count 896
Performed 153 Post agglomeration using F-continuation condition with reduction of 44 identical transitions.
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 5 with 306 rules applied. Total rules applied 370 place count 310 transition count 699
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 5 with 84 rules applied. Total rules applied 454 place count 310 transition count 615
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 484 place count 295 transition count 594
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 495 place count 295 transition count 583
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 523 place count 281 transition count 591
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 528 place count 281 transition count 586
Drop transitions removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 8 with 68 rules applied. Total rules applied 596 place count 281 transition count 518
Applied a total of 596 rules in 135 ms. Remains 281 /583 variables (removed 302) and now considering 518/1135 (removed 617) transitions.
[2023-03-14 04:14:45] [INFO ] Flow matrix only has 510 transitions (discarded 8 similar events)
// Phase 1: matrix 510 rows 281 cols
[2023-03-14 04:14:45] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-14 04:14:45] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-14 04:14:45] [INFO ] Flow matrix only has 510 transitions (discarded 8 similar events)
[2023-03-14 04:14:45] [INFO ] Invariant cache hit.
[2023-03-14 04:14:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-14 04:14:46] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2023-03-14 04:14:46] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-14 04:14:46] [INFO ] Flow matrix only has 510 transitions (discarded 8 similar events)
[2023-03-14 04:14:46] [INFO ] Invariant cache hit.
[2023-03-14 04:14:46] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/583 places, 518/1135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1507 ms. Remains : 281/583 places, 518/1135 transitions.
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s270 1) (EQ s276 1)), p2:(EQ s93 1), p1:(EQ s25 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-06 finished in 1926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 570 transition count 1116
Ensure Unique test removed 5 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 565 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 565 transition count 1115
Applied a total of 32 rules in 27 ms. Remains 565 /583 variables (removed 18) and now considering 1115/1135 (removed 20) transitions.
// Phase 1: matrix 1115 rows 565 cols
[2023-03-14 04:14:47] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-14 04:14:47] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-14 04:14:47] [INFO ] Invariant cache hit.
[2023-03-14 04:14:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:48] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2023-03-14 04:14:48] [INFO ] Invariant cache hit.
[2023-03-14 04:14:49] [INFO ] Dead Transitions using invariants and state equation in 1208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 565/583 places, 1115/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2324 ms. Remains : 565/583 places, 1115/1135 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-07 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 s151 1) (EQ s163 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-7A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-07 finished in 2431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 715 edges and 583 vertex of which 106 / 583 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 485 transition count 892
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 470 transition count 891
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 456 transition count 871
Ensure Unique test removed 6 places
Iterating global reduction 2 with 20 rules applied. Total rules applied 64 place count 450 transition count 871
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 450 transition count 867
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 448 transition count 866
Performed 148 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 367 place count 300 transition count 676
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 4 with 82 rules applied. Total rules applied 449 place count 300 transition count 594
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 479 place count 285 transition count 573
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 490 place count 285 transition count 562
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 518 place count 271 transition count 570
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 523 place count 271 transition count 565
Drop transitions removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 7 with 71 rules applied. Total rules applied 594 place count 271 transition count 494
Applied a total of 594 rules in 77 ms. Remains 271 /583 variables (removed 312) and now considering 494/1135 (removed 641) transitions.
// Phase 1: matrix 494 rows 271 cols
[2023-03-14 04:14:49] [INFO ] Computed 54 place invariants in 3 ms
[2023-03-14 04:14:50] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-14 04:14:50] [INFO ] Invariant cache hit.
[2023-03-14 04:14:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:50] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2023-03-14 04:14:50] [INFO ] Redundant transitions in 174 ms returned [380, 386, 388, 389, 396, 402, 404, 408, 412, 414, 415, 417, 418, 424, 426, 428, 433, 435, 436]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
// Phase 1: matrix 475 rows 271 cols
[2023-03-14 04:14:50] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-14 04:14:51] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 271/583 places, 475/1135 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 271 transition count 470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 266 transition count 470
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 261 transition count 465
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 259 transition count 465
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 259 transition count 463
Applied a total of 26 rules in 42 ms. Remains 259 /271 variables (removed 12) and now considering 463/475 (removed 12) transitions.
// Phase 1: matrix 463 rows 259 cols
[2023-03-14 04:14:51] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-14 04:14:51] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-14 04:14:51] [INFO ] Invariant cache hit.
[2023-03-14 04:14:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:51] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 259/583 places, 463/1135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2027 ms. Remains : 259/583 places, 463/1135 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s201 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-08 finished in 2080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 718 edges and 583 vertex of which 106 / 583 are part of one of the 9 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 485 transition count 892
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 470 transition count 891
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 43 place count 457 transition count 873
Ensure Unique test removed 6 places
Iterating global reduction 2 with 19 rules applied. Total rules applied 62 place count 451 transition count 873
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 66 place count 451 transition count 869
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 449 transition count 868
Performed 147 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 363 place count 302 transition count 681
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 4 with 84 rules applied. Total rules applied 447 place count 302 transition count 597
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 477 place count 287 transition count 576
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 488 place count 287 transition count 565
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 518 place count 272 transition count 573
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 523 place count 272 transition count 568
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 7 with 72 rules applied. Total rules applied 595 place count 272 transition count 496
Applied a total of 595 rules in 94 ms. Remains 272 /583 variables (removed 311) and now considering 496/1135 (removed 639) transitions.
[2023-03-14 04:14:52] [INFO ] Flow matrix only has 495 transitions (discarded 1 similar events)
// Phase 1: matrix 495 rows 272 cols
[2023-03-14 04:14:52] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-14 04:14:52] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-14 04:14:52] [INFO ] Flow matrix only has 495 transitions (discarded 1 similar events)
[2023-03-14 04:14:52] [INFO ] Invariant cache hit.
[2023-03-14 04:14:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:52] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-14 04:14:52] [INFO ] Redundant transitions in 256 ms returned [380, 386, 388, 389, 396, 402, 404, 408, 412, 414, 415, 417, 418, 424, 426, 428, 433, 435, 436]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
[2023-03-14 04:14:52] [INFO ] Flow matrix only has 476 transitions (discarded 1 similar events)
// Phase 1: matrix 476 rows 272 cols
[2023-03-14 04:14:52] [INFO ] Computed 54 place invariants in 2 ms
[2023-03-14 04:14:53] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/583 places, 477/1135 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 272 transition count 472
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 267 transition count 472
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 262 transition count 467
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 260 transition count 467
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 260 transition count 465
Applied a total of 26 rules in 21 ms. Remains 260 /272 variables (removed 12) and now considering 465/477 (removed 12) transitions.
[2023-03-14 04:14:53] [INFO ] Flow matrix only has 464 transitions (discarded 1 similar events)
// Phase 1: matrix 464 rows 260 cols
[2023-03-14 04:14:53] [INFO ] Computed 54 place invariants in 6 ms
[2023-03-14 04:14:53] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-14 04:14:53] [INFO ] Flow matrix only has 464 transitions (discarded 1 similar events)
[2023-03-14 04:14:53] [INFO ] Invariant cache hit.
[2023-03-14 04:14:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:54] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 260/583 places, 465/1135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2234 ms. Remains : 260/583 places, 465/1135 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-09 finished in 2299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(!p1) U p2))))'
Support contains 3 out of 583 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 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 707 edges and 583 vertex of which 106 / 583 are part of one of the 9 SCC in 4 ms
Free SCC test removed 97 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 486 transition count 894
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 474 transition count 893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 473 transition count 893
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 41 place count 459 transition count 873
Ensure Unique test removed 6 places
Iterating global reduction 3 with 20 rules applied. Total rules applied 61 place count 453 transition count 873
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 65 place count 453 transition count 869
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 452 transition count 869
Performed 145 Post agglomeration using F-continuation condition with reduction of 41 identical transitions.
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 5 with 290 rules applied. Total rules applied 356 place count 307 transition count 683
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 5 with 80 rules applied. Total rules applied 436 place count 307 transition count 603
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 462 place count 294 transition count 586
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 472 place count 294 transition count 576
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 500 place count 280 transition count 584
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 505 place count 280 transition count 579
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 8 with 66 rules applied. Total rules applied 571 place count 280 transition count 513
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 572 place count 280 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 573 place count 279 transition count 512
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 575 place count 279 transition count 510
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 575 place count 279 transition count 509
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 577 place count 278 transition count 509
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 578 place count 278 transition count 509
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 579 place count 278 transition count 508
Applied a total of 579 rules in 135 ms. Remains 278 /583 variables (removed 305) and now considering 508/1135 (removed 627) transitions.
[2023-03-14 04:14:54] [INFO ] Flow matrix only has 500 transitions (discarded 8 similar events)
// Phase 1: matrix 500 rows 278 cols
[2023-03-14 04:14:54] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 04:14:54] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-14 04:14:54] [INFO ] Flow matrix only has 500 transitions (discarded 8 similar events)
[2023-03-14 04:14:54] [INFO ] Invariant cache hit.
[2023-03-14 04:14:54] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-14 04:14:55] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-14 04:14:55] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 04:14:55] [INFO ] Flow matrix only has 500 transitions (discarded 8 similar events)
[2023-03-14 04:14:55] [INFO ] Invariant cache hit.
[2023-03-14 04:14:55] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/583 places, 508/1135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1502 ms. Remains : 278/583 places, 508/1135 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s252 1), p2:(AND (EQ s5 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-10 finished in 1579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(G(p1))))||G(p2)))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 571 transition count 1119
Ensure Unique test removed 6 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 30 place count 565 transition count 1119
Applied a total of 30 rules in 24 ms. Remains 565 /583 variables (removed 18) and now considering 1119/1135 (removed 16) transitions.
[2023-03-14 04:14:55] [INFO ] Flow matrix only has 1118 transitions (discarded 1 similar events)
// Phase 1: matrix 1118 rows 565 cols
[2023-03-14 04:14:55] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 04:14:56] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-14 04:14:56] [INFO ] Flow matrix only has 1118 transitions (discarded 1 similar events)
[2023-03-14 04:14:56] [INFO ] Invariant cache hit.
[2023-03-14 04:14:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:14:57] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
[2023-03-14 04:14:57] [INFO ] Flow matrix only has 1118 transitions (discarded 1 similar events)
[2023-03-14 04:14:57] [INFO ] Invariant cache hit.
[2023-03-14 04:14:58] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 565/583 places, 1119/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2268 ms. Remains : 565/583 places, 1119/1135 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s171 0), p0:(EQ s432 1), p1:(OR (EQ s425 0) (EQ s433 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33369 reset in 1395 ms.
Product exploration explored 100000 steps with 33295 reset in 1352 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 : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 816 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p1)), true, (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 04:15:02] [INFO ] Flow matrix only has 1118 transitions (discarded 1 similar events)
[2023-03-14 04:15:02] [INFO ] Invariant cache hit.
[2023-03-14 04:15:02] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 04:15:02] [INFO ] [Nat]Absence check using 57 positive place invariants in 31 ms returned sat
[2023-03-14 04:15:03] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 04:15:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:15:03] [INFO ] After 58ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 04:15:03] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-14 04:15:03] [INFO ] After 949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 1119/1119 transitions.
Graph (trivial) has 709 edges and 565 vertex of which 106 / 565 are part of one of the 9 SCC in 0 ms
Free SCC test removed 97 places
Drop transitions removed 192 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 468 transition count 866
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 455 transition count 866
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 454 transition count 864
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 454 transition count 864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 454 transition count 863
Performed 147 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 324 place count 307 transition count 674
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 3 with 81 rules applied. Total rules applied 405 place count 307 transition count 593
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 435 place count 292 transition count 572
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 446 place count 292 transition count 561
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 474 place count 278 transition count 569
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 479 place count 278 transition count 564
Drop transitions removed 65 transitions
Redundant transition composition rules discarded 65 transitions
Iterating global reduction 6 with 65 rules applied. Total rules applied 544 place count 278 transition count 499
Free-agglomeration rule applied 41 times with reduction of 25 identical transitions.
Iterating global reduction 6 with 41 rules applied. Total rules applied 585 place count 278 transition count 433
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 70 rules applied. Total rules applied 655 place count 237 transition count 404
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 661 place count 237 transition count 398
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 662 place count 237 transition count 397
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 664 place count 236 transition count 396
Free-agglomeration rule (complex) applied 17 times with reduction of 2 identical transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 681 place count 236 transition count 433
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 705 place count 219 transition count 426
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 9 with 33 rules applied. Total rules applied 738 place count 219 transition count 393
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 9 with 37 rules applied. Total rules applied 775 place count 219 transition count 393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 776 place count 218 transition count 392
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 779 place count 215 transition count 392
Applied a total of 779 rules in 164 ms. Remains 215 /565 variables (removed 350) and now considering 392/1119 (removed 727) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 215/565 places, 392/1119 transitions.
Finished random walk after 811 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p1)), (X p1), (X (X p2)), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p2 p1))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p2) (NOT p1)))
Knowledge based reduction with 18 factoid took 476 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-7A-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-7A-LTLFireability-11 finished in 8198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1||G(p0))))))'
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 569 transition count 1115
Ensure Unique test removed 6 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 34 place count 563 transition count 1115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 563 transition count 1114
Applied a total of 35 rules in 15 ms. Remains 563 /583 variables (removed 20) and now considering 1114/1135 (removed 21) transitions.
// Phase 1: matrix 1114 rows 563 cols
[2023-03-14 04:15:04] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 04:15:04] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-14 04:15:04] [INFO ] Invariant cache hit.
[2023-03-14 04:15:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:15:04] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2023-03-14 04:15:04] [INFO ] Invariant cache hit.
[2023-03-14 04:15:05] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 563/583 places, 1114/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1972 ms. Remains : 563/583 places, 1114/1135 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s266 1), p1:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 309 reset in 526 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-13 finished in 2626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||X(p1))) U ((p2&&G(p3)) U p1)))'
Support contains 4 out of 583 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 583/583 places, 1135/1135 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 570 transition count 1117
Ensure Unique test removed 6 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 32 place count 564 transition count 1117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 564 transition count 1116
Applied a total of 33 rules in 30 ms. Remains 564 /583 variables (removed 19) and now considering 1116/1135 (removed 19) transitions.
[2023-03-14 04:15:06] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
// Phase 1: matrix 1115 rows 564 cols
[2023-03-14 04:15:06] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 04:15:06] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-14 04:15:07] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2023-03-14 04:15:07] [INFO ] Invariant cache hit.
[2023-03-14 04:15:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:15:07] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2023-03-14 04:15:07] [INFO ] Flow matrix only has 1115 transitions (discarded 1 similar events)
[2023-03-14 04:15:07] [INFO ] Invariant cache hit.
[2023-03-14 04:15:08] [INFO ] Dead Transitions using invariants and state equation in 933 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 564/583 places, 1116/1135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2024 ms. Remains : 564/583 places, 1116/1135 transitions.
Stuttering acceptance computed with spot in 584 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), true, (AND p1 (NOT p0)), (NOT p3), (AND p1 (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=0 dest: 8}], [{ cond=(NOT p1), acceptance={} source=1 dest: 9}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}, { cond=(AND p3 p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p2 p3), acceptance={0} source=6 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=7 dest: 12}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=8 dest: 9}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=8 dest: 12}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND p1 p0), acceptance={} source=10 dest: 10}], [{ cond=(NOT p3), acceptance={} source=11 dest: 9}, { cond=p3, acceptance={} source=11 dest: 11}], [{ cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=12 dest: 9}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=12 dest: 10}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=12 dest: 11}, { cond=(AND p1 p3 p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s536 1), p2:(EQ s344 1), p3:(AND (EQ s282 1) (EQ s302 1)), p0:(OR (EQ s344 1) (EQ s536 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, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-14 finished in 2655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U G(p2))||p0))))'
Support contains 5 out of 583 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 : 583/583 places, 1135/1135 transitions.
Graph (trivial) has 709 edges and 583 vertex of which 89 / 583 are part of one of the 8 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 501 transition count 928
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 486 transition count 927
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 43 place count 473 transition count 908
Ensure Unique test removed 5 places
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 468 transition count 908
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 468 transition count 904
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 466 transition count 903
Performed 152 Post agglomeration using F-continuation condition with reduction of 43 identical transitions.
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 4 with 304 rules applied. Total rules applied 372 place count 314 transition count 708
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 459 place count 314 transition count 621
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 489 place count 299 transition count 600
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 500 place count 299 transition count 589
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 528 place count 285 transition count 597
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 533 place count 285 transition count 592
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 7 with 73 rules applied. Total rules applied 606 place count 285 transition count 519
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 606 place count 285 transition count 518
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 608 place count 284 transition count 518
Applied a total of 608 rules in 73 ms. Remains 284 /583 variables (removed 299) and now considering 518/1135 (removed 617) transitions.
// Phase 1: matrix 518 rows 284 cols
[2023-03-14 04:15:09] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 04:15:09] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-14 04:15:09] [INFO ] Invariant cache hit.
[2023-03-14 04:15:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:15:10] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2023-03-14 04:15:10] [INFO ] Redundant transitions in 154 ms returned [403, 409, 411, 412, 419, 425, 427, 431, 435, 437, 438, 440, 441, 447, 449, 451, 456, 458, 459]
Found 19 redundant transitions using SMT.
Drop transitions removed 19 transitions
Redundant transitions reduction (with SMT) removed 19 transitions.
// Phase 1: matrix 499 rows 284 cols
[2023-03-14 04:15:10] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 04:15:10] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/583 places, 499/1135 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 284 transition count 494
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 279 transition count 494
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 274 transition count 489
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 272 transition count 489
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 272 transition count 487
Applied a total of 26 rules in 21 ms. Remains 272 /284 variables (removed 12) and now considering 487/499 (removed 12) transitions.
// Phase 1: matrix 487 rows 272 cols
[2023-03-14 04:15:10] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 04:15:10] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-14 04:15:10] [INFO ] Invariant cache hit.
[2023-03-14 04:15:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-14 04:15:11] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 272/583 places, 487/1135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1874 ms. Remains : 272/583 places, 487/1135 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-7A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s80 1) (EQ s91 1)), p0:(OR (EQ s58 0) (AND (EQ s156 1) (EQ s166 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 200 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-7A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-7A-LTLFireability-15 finished in 1963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(G(!p1)||(!p1&&F(G(p2)))))))'
[2023-03-14 04:15:11] [INFO ] Flatten gal took : 87 ms
[2023-03-14 04:15:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-14 04:15:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 583 places, 1135 transitions and 3006 arcs took 10 ms.
Total runtime 67114 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-7A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678767462772

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 NoC3x3-PT-7A-LTLFireability-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/1800 2/32 NoC3x3-PT-7A-LTLFireability-00 202844 m, 40568 m/sec, 334746 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/1800 4/32 NoC3x3-PT-7A-LTLFireability-00 447711 m, 48973 m/sec, 787739 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/1800 5/32 NoC3x3-PT-7A-LTLFireability-00 665436 m, 43545 m/sec, 1196539 t fired, .

Time elapsed: 15 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/1800 7/32 NoC3x3-PT-7A-LTLFireability-00 883271 m, 43567 m/sec, 1608438 t fired, .

Time elapsed: 20 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/1800 9/32 NoC3x3-PT-7A-LTLFireability-00 1106890 m, 44723 m/sec, 2030145 t fired, .

Time elapsed: 25 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 30/1800 10/32 NoC3x3-PT-7A-LTLFireability-00 1327903 m, 44202 m/sec, 2448917 t fired, .

Time elapsed: 30 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 35/1800 12/32 NoC3x3-PT-7A-LTLFireability-00 1531114 m, 40642 m/sec, 2842237 t fired, .

Time elapsed: 35 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 40/1800 13/32 NoC3x3-PT-7A-LTLFireability-00 1732628 m, 40302 m/sec, 3230505 t fired, .

Time elapsed: 40 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 45/1800 15/32 NoC3x3-PT-7A-LTLFireability-00 1933437 m, 40161 m/sec, 3619792 t fired, .

Time elapsed: 45 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 50/1800 16/32 NoC3x3-PT-7A-LTLFireability-00 2119850 m, 37282 m/sec, 3983666 t fired, .

Time elapsed: 50 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 55/1800 17/32 NoC3x3-PT-7A-LTLFireability-00 2314186 m, 38867 m/sec, 4362376 t fired, .

Time elapsed: 55 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 60/1800 19/32 NoC3x3-PT-7A-LTLFireability-00 2510395 m, 39241 m/sec, 4743397 t fired, .

Time elapsed: 60 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 65/1800 20/32 NoC3x3-PT-7A-LTLFireability-00 2710741 m, 40069 m/sec, 5132070 t fired, .

Time elapsed: 65 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 70/1800 22/32 NoC3x3-PT-7A-LTLFireability-00 2896461 m, 37144 m/sec, 5494523 t fired, .

Time elapsed: 70 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 75/1800 23/32 NoC3x3-PT-7A-LTLFireability-00 3089211 m, 38550 m/sec, 5868605 t fired, .

Time elapsed: 75 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 80/1800 25/32 NoC3x3-PT-7A-LTLFireability-00 3288859 m, 39929 m/sec, 6257643 t fired, .

Time elapsed: 80 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 85/1800 26/32 NoC3x3-PT-7A-LTLFireability-00 3488457 m, 39919 m/sec, 6646866 t fired, .

Time elapsed: 85 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 90/1800 27/32 NoC3x3-PT-7A-LTLFireability-00 3687590 m, 39826 m/sec, 7034488 t fired, .

Time elapsed: 90 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 95/1800 29/32 NoC3x3-PT-7A-LTLFireability-00 3885526 m, 39587 m/sec, 7416842 t fired, .

Time elapsed: 95 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 100/1800 30/32 NoC3x3-PT-7A-LTLFireability-00 4093701 m, 41635 m/sec, 7825078 t fired, .

Time elapsed: 100 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 105/1800 32/32 NoC3x3-PT-7A-LTLFireability-00 4293813 m, 40022 m/sec, 8219751 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 3 (type EXCL) for NoC3x3-PT-7A-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: LAUNCH task # 5 (type EXCL) for 0 NoC3x3-PT-7A-LTLFireability-00
lola: time limit : 3490 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/3490 5/32 NoC3x3-PT-7A-LTLFireability-00 472232 m, 94446 m/sec, 1118427 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/3490 10/32 NoC3x3-PT-7A-LTLFireability-00 939229 m, 93399 m/sec, 2255481 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/3490 14/32 NoC3x3-PT-7A-LTLFireability-00 1391005 m, 90355 m/sec, 3389498 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/3490 18/32 NoC3x3-PT-7A-LTLFireability-00 1835871 m, 88973 m/sec, 4497659 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/3490 22/32 NoC3x3-PT-7A-LTLFireability-00 2282638 m, 89353 m/sec, 5617148 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/3490 27/32 NoC3x3-PT-7A-LTLFireability-00 2743136 m, 92099 m/sec, 6733493 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/3490 31/32 NoC3x3-PT-7A-LTLFireability-00 3199939 m, 91360 m/sec, 7862910 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 5 (type EXCL) for NoC3x3-PT-7A-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-7A-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-7A-LTLFireability-00: CONJ unknown CONJ


Time elapsed: 150 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-7A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is NoC3x3-PT-7A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538100324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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