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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 10:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 10:08 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.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 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 133K 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-3A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678754617925

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-3A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 00:43:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 00:43:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:43:41] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-14 00:43:41] [INFO ] Transformed 370 places.
[2023-03-14 00:43:41] [INFO ] Transformed 450 transitions.
[2023-03-14 00:43:41] [INFO ] Found NUPN structural information;
[2023-03-14 00:43:41] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 353 transition count 449
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 122 place count 248 transition count 324
Ensure Unique test removed 38 places
Iterating global reduction 1 with 143 rules applied. Total rules applied 265 place count 210 transition count 324
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 329 place count 210 transition count 260
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 353 place count 210 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 361 place count 202 transition count 236
Applied a total of 361 rules in 116 ms. Remains 202 /370 variables (removed 168) and now considering 236/449 (removed 213) transitions.
[2023-03-14 00:43:41] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
// Phase 1: matrix 225 rows 202 cols
[2023-03-14 00:43:41] [INFO ] Computed 64 place invariants in 17 ms
[2023-03-14 00:43:42] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-14 00:43:42] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
[2023-03-14 00:43:42] [INFO ] Invariant cache hit.
[2023-03-14 00:43:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-14 00:43:42] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2023-03-14 00:43:42] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
[2023-03-14 00:43:42] [INFO ] Invariant cache hit.
[2023-03-14 00:43:43] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/370 places, 236/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1535 ms. Remains : 202/370 places, 236/449 transitions.
Support contains 38 out of 202 places after structural reductions.
[2023-03-14 00:43:43] [INFO ] Flatten gal took : 116 ms
[2023-03-14 00:43:43] [INFO ] Flatten gal took : 44 ms
[2023-03-14 00:43:43] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 34 out of 202 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 00:43:44] [INFO ] Flow matrix only has 225 transitions (discarded 11 similar events)
[2023-03-14 00:43:44] [INFO ] Invariant cache hit.
[2023-03-14 00:43:44] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-14 00:43:44] [INFO ] [Real]Absence check using 58 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-14 00:43:44] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 00:43:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-14 00:43:44] [INFO ] [Nat]Absence check using 58 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-14 00:43:44] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 00:43:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-14 00:43:45] [INFO ] After 57ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 00:43:45] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-14 00:43:45] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 563 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 200 transition count 174
Reduce places removed 53 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 121 place count 147 transition count 170
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 143 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 133 place count 135 transition count 159
Ensure Unique test removed 5 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 146 place count 130 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 11 rules applied. Total rules applied 157 place count 130 transition count 148
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 162 place count 126 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 163 place count 125 transition count 147
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 192 place count 125 transition count 147
Applied a total of 192 rules in 84 ms. Remains 125 /202 variables (removed 77) and now considering 147/236 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 125/202 places, 147/236 transitions.
Finished random walk after 268 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=38 )
FORMULA NoC3x3-PT-3A-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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(X(X(F(p0)))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 191 transition count 223
Ensure Unique test removed 5 places
Iterating global reduction 1 with 14 rules applied. Total rules applied 25 place count 186 transition count 223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 32 place count 186 transition count 216
Applied a total of 32 rules in 9 ms. Remains 186 /202 variables (removed 16) and now considering 216/236 (removed 20) transitions.
[2023-03-14 00:43:45] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-14 00:43:45] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-14 00:43:45] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-14 00:43:45] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:45] [INFO ] Invariant cache hit.
[2023-03-14 00:43:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:46] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-14 00:43:46] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:46] [INFO ] Invariant cache hit.
[2023-03-14 00:43:46] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/202 places, 216/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 186/202 places, 216/236 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s20 0) (EQ s35 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1277 ms.
Product exploration explored 100000 steps with 25000 reset in 758 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-14 00:43:49] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:49] [INFO ] Invariant cache hit.
[2023-03-14 00:43:49] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-14 00:43:49] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:49] [INFO ] Invariant cache hit.
[2023-03-14 00:43:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:49] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-14 00:43:49] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:49] [INFO ] Invariant cache hit.
[2023-03-14 00:43:49] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 186/186 places, 216/216 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 535 ms.
Product exploration explored 100000 steps with 25000 reset in 576 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 216/216 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 186 transition count 216
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 62 rules in 19 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-14 00:43:52] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-14 00:43:52] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-14 00:43:52] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 00:43:52] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/186 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 186/186 places, 216/216 transitions.
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-14 00:43:52] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2023-03-14 00:43:52] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 00:43:52] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-14 00:43:52] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:52] [INFO ] Invariant cache hit.
[2023-03-14 00:43:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:53] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-03-14 00:43:53] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2023-03-14 00:43:53] [INFO ] Invariant cache hit.
[2023-03-14 00:43:53] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 752 ms. Remains : 186/186 places, 216/216 transitions.
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 7821 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 U (!p1&&X(p0)))&&F(p2)))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 193 transition count 225
Ensure Unique test removed 3 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 190 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 190 transition count 220
Applied a total of 24 rules in 6 ms. Remains 190 /202 variables (removed 12) and now considering 220/236 (removed 16) transitions.
[2023-03-14 00:43:53] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 190 cols
[2023-03-14 00:43:53] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-14 00:43:53] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-14 00:43:53] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-14 00:43:53] [INFO ] Invariant cache hit.
[2023-03-14 00:43:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:53] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-14 00:43:53] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-14 00:43:53] [INFO ] Invariant cache hit.
[2023-03-14 00:43:53] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/202 places, 220/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 190/202 places, 220/236 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p2) p1), true, (NOT p0), (OR (NOT p0) p1), (NOT p2), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(AND (EQ s141 1) (EQ s144 1)), p0:(AND (EQ s79 1) (EQ s101 1)), p2:(OR (NEQ s84 1) (NEQ s105 1))], nbAcceptance=0, 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 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-01 finished in 879 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||F(!p1)) U (G((p0||F(!p1)))||X(!p1))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 192 transition count 225
Ensure Unique test removed 5 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 23 place count 187 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 28 place count 187 transition count 220
Applied a total of 28 rules in 11 ms. Remains 187 /202 variables (removed 15) and now considering 220/236 (removed 16) transitions.
[2023-03-14 00:43:54] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 187 cols
[2023-03-14 00:43:54] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-14 00:43:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-14 00:43:54] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-14 00:43:54] [INFO ] Invariant cache hit.
[2023-03-14 00:43:54] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-14 00:43:54] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-14 00:43:54] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2023-03-14 00:43:54] [INFO ] Invariant cache hit.
[2023-03-14 00:43:54] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 220/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 187/202 places, 220/236 transitions.
Stuttering acceptance computed with spot in 159 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s115 1) (EQ s129 1)), p0:(NEQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 817 ms.
Product exploration explored 100000 steps with 50000 reset in 877 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), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3A-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3A-LTLFireability-02 finished in 2531 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)&&F(G(p1)))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 201 transition count 182
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 147 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 144 transition count 179
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 136 transition count 167
Ensure Unique test removed 4 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 134 place count 132 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 143 place count 132 transition count 158
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 147 place count 129 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 128 transition count 157
Applied a total of 148 rules in 27 ms. Remains 128 /202 variables (removed 74) and now considering 157/236 (removed 79) transitions.
[2023-03-14 00:43:56] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 128 cols
[2023-03-14 00:43:56] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-14 00:43:56] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-14 00:43:56] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2023-03-14 00:43:56] [INFO ] Invariant cache hit.
[2023-03-14 00:43:57] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 00:43:57] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-14 00:43:57] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 00:43:57] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2023-03-14 00:43:57] [INFO ] Invariant cache hit.
[2023-03-14 00:43:57] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/202 places, 157/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 128/202 places, 157/236 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s86 1), p1:(AND (EQ s104 1) (EQ s114 1) (EQ s108 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-03 finished in 642 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(p0)||X((X(F(p2))&&p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 192 transition count 225
Ensure Unique test removed 5 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 23 place count 187 transition count 225
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 30 place count 187 transition count 218
Applied a total of 30 rules in 8 ms. Remains 187 /202 variables (removed 15) and now considering 218/236 (removed 18) transitions.
[2023-03-14 00:43:57] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
// Phase 1: matrix 209 rows 187 cols
[2023-03-14 00:43:57] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 00:43:57] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-14 00:43:57] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2023-03-14 00:43:57] [INFO ] Invariant cache hit.
[2023-03-14 00:43:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:43:58] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-14 00:43:58] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2023-03-14 00:43:58] [INFO ] Invariant cache hit.
[2023-03-14 00:43:58] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 883 ms. Remains : 187/202 places, 218/236 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(OR (EQ s137 0) (EQ s148 0)), p0:(AND (EQ s77 1) (EQ s100 1)), p1:(AND (EQ s137 1) (EQ s148 1) (EQ s77 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-06 finished in 1263 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(((p1 U p2)||p0))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 201 transition count 187
Reduce places removed 49 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 56 rules applied. Total rules applied 106 place count 152 transition count 180
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 113 place count 145 transition count 180
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 122 place count 136 transition count 167
Ensure Unique test removed 5 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 136 place count 131 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 3 with 12 rules applied. Total rules applied 148 place count 131 transition count 155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 153 place count 126 transition count 155
Applied a total of 153 rules in 38 ms. Remains 126 /202 variables (removed 76) and now considering 155/236 (removed 81) transitions.
[2023-03-14 00:43:58] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
// Phase 1: matrix 147 rows 126 cols
[2023-03-14 00:43:58] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:43:58] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-14 00:43:58] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
[2023-03-14 00:43:58] [INFO ] Invariant cache hit.
[2023-03-14 00:43:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 00:43:59] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-14 00:43:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 00:43:59] [INFO ] Flow matrix only has 147 transitions (discarded 8 similar events)
[2023-03-14 00:43:59] [INFO ] Invariant cache hit.
[2023-03-14 00:43:59] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/202 places, 155/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 635 ms. Remains : 126/202 places, 155/236 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s22 1) (EQ s23 1)) (AND (EQ s59 1) (EQ s75 1))), p2:(AND (EQ s59 1) (EQ s75 1)), p1:(AND (EQ s19 1) (EQ s24 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-10 finished in 747 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)&&F(p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 200 transition count 184
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 148 transition count 184
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 141 transition count 175
Ensure Unique test removed 5 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 124 place count 136 transition count 175
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 12 rules applied. Total rules applied 136 place count 136 transition count 163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 141 place count 131 transition count 163
Applied a total of 141 rules in 19 ms. Remains 131 /202 variables (removed 71) and now considering 163/236 (removed 73) transitions.
[2023-03-14 00:43:59] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
// Phase 1: matrix 153 rows 131 cols
[2023-03-14 00:43:59] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-14 00:43:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-14 00:43:59] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
[2023-03-14 00:43:59] [INFO ] Invariant cache hit.
[2023-03-14 00:43:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 00:43:59] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-14 00:43:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 00:43:59] [INFO ] Flow matrix only has 153 transitions (discarded 10 similar events)
[2023-03-14 00:43:59] [INFO ] Invariant cache hit.
[2023-03-14 00:43:59] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/202 places, 163/236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 550 ms. Remains : 131/202 places, 163/236 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s71 1)), p1:(AND (EQ s63 1) (EQ s92 1) (EQ s15 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-11 finished in 755 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)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 199 transition count 178
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 128 place count 135 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 128 place count 135 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 133 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 131 place count 133 transition count 170
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 132 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 142 place count 123 transition count 157
Ensure Unique test removed 5 places
Iterating global reduction 2 with 14 rules applied. Total rules applied 156 place count 118 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 12 rules applied. Total rules applied 168 place count 118 transition count 145
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 181 place count 110 transition count 140
Applied a total of 181 rules in 21 ms. Remains 110 /202 variables (removed 92) and now considering 140/236 (removed 96) transitions.
// Phase 1: matrix 140 rows 110 cols
[2023-03-14 00:44:00] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-14 00:44:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-14 00:44:00] [INFO ] Invariant cache hit.
[2023-03-14 00:44:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-14 00:44:00] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-14 00:44:00] [INFO ] Redundant transitions in 109 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 92, 93, 95, 99, 102, 103, 104, 110, 111, 112, 114, 118, 121, 122, 124, 127, 128, 129, 130, 136]
Found 34 redundant transitions using SMT.
Drop transitions removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
// Phase 1: matrix 106 rows 110 cols
[2023-03-14 00:44:00] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-14 00:44:00] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/202 places, 106/236 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 110 transition count 93
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 84 transition count 93
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 84 transition count 88
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 43 edges and 74 vertex of which 16 / 74 are part of one of the 8 SCC in 3 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 66 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 66 transition count 75
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 95 place count 48 transition count 66
Graph (trivial) has 35 edges and 48 vertex of which 18 / 48 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 39 transition count 66
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 105 place count 39 transition count 57
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 122 place count 39 transition count 40
Applied a total of 122 rules in 22 ms. Remains 39 /110 variables (removed 71) and now considering 40/106 (removed 66) transitions.
// Phase 1: matrix 40 rows 39 cols
[2023-03-14 00:44:00] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-14 00:44:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-14 00:44:00] [INFO ] Invariant cache hit.
[2023-03-14 00:44:00] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/202 places, 40/236 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 747 ms. Remains : 39/202 places, 40/236 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-14 finished in 814 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(p0)))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 236
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 192 transition count 224
Ensure Unique test removed 4 places
Iterating global reduction 1 with 12 rules applied. Total rules applied 22 place count 188 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 188 transition count 218
Applied a total of 28 rules in 10 ms. Remains 188 /202 variables (removed 14) and now considering 218/236 (removed 18) transitions.
[2023-03-14 00:44:01] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2023-03-14 00:44:01] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 00:44:01] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-14 00:44:01] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:44:01] [INFO ] Invariant cache hit.
[2023-03-14 00:44:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-14 00:44:01] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-14 00:44:01] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2023-03-14 00:44:01] [INFO ] Invariant cache hit.
[2023-03-14 00:44:01] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 188/202 places, 218/236 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s114 1) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-15 finished in 804 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(X(X(F(p0)))))'
Found a Shortening insensitive property : NoC3x3-PT-3A-LTLFireability-00
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Graph (complete) has 596 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 200 transition count 182
Reduce places removed 54 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 146 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 143 transition count 179
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 124 place count 134 transition count 166
Ensure Unique test removed 5 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 138 place count 129 transition count 166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 3 with 12 rules applied. Total rules applied 150 place count 129 transition count 154
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 155 place count 124 transition count 154
Applied a total of 155 rules in 29 ms. Remains 124 /202 variables (removed 78) and now considering 154/236 (removed 82) transitions.
[2023-03-14 00:44:02] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
// Phase 1: matrix 146 rows 124 cols
[2023-03-14 00:44:02] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 00:44:02] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-14 00:44:02] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2023-03-14 00:44:02] [INFO ] Invariant cache hit.
[2023-03-14 00:44:02] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 00:44:02] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-14 00:44:02] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2023-03-14 00:44:02] [INFO ] Invariant cache hit.
[2023-03-14 00:44:02] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/202 places, 154/236 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 637 ms. Remains : 124/202 places, 154/236 transitions.
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s17 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4255 steps with 1063 reset in 32 ms.
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 926 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-14 00:44:02] [INFO ] Flatten gal took : 22 ms
[2023-03-14 00:44:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2023-03-14 00:44:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 236 transitions and 803 arcs took 3 ms.
Total runtime 21752 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-3A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA NoC3x3-PT-3A-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678754644227

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 NoC3x3-PT-3A-LTLFireability-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for NoC3x3-PT-3A-LTLFireability-00
lola: result : true
lola: markings : 378
lola: fired transitions : 901
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-3A-LTLFireability-00: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

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

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