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.r359-smll-167891808700268.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 SafeBus-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808700268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K Feb 26 01:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 26 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 156K Feb 26 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 26 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 26 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 303K 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 SafeBus-PT-06-LTLFireability-00
FORMULA_NAME SafeBus-PT-06-LTLFireability-01
FORMULA_NAME SafeBus-PT-06-LTLFireability-02
FORMULA_NAME SafeBus-PT-06-LTLFireability-03
FORMULA_NAME SafeBus-PT-06-LTLFireability-04
FORMULA_NAME SafeBus-PT-06-LTLFireability-05
FORMULA_NAME SafeBus-PT-06-LTLFireability-06
FORMULA_NAME SafeBus-PT-06-LTLFireability-07
FORMULA_NAME SafeBus-PT-06-LTLFireability-08
FORMULA_NAME SafeBus-PT-06-LTLFireability-09
FORMULA_NAME SafeBus-PT-06-LTLFireability-10
FORMULA_NAME SafeBus-PT-06-LTLFireability-11
FORMULA_NAME SafeBus-PT-06-LTLFireability-12
FORMULA_NAME SafeBus-PT-06-LTLFireability-13
FORMULA_NAME SafeBus-PT-06-LTLFireability-14
FORMULA_NAME SafeBus-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679048323581

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=SafeBus-PT-06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 10:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:18:47] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-17 10:18:47] [INFO ] Transformed 144 places.
[2023-03-17 10:18:47] [INFO ] Transformed 451 transitions.
[2023-03-17 10:18:47] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 6 places and 0 transitions.
FORMULA SafeBus-PT-06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 126 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 42 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2023-03-17 10:18:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:18:47] [INFO ] Computed 29 place invariants in 46 ms
[2023-03-17 10:18:48] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-17 10:18:48] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2023-03-17 10:18:48] [INFO ] Invariant cache hit.
[2023-03-17 10:18:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:18:48] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2023-03-17 10:18:48] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2023-03-17 10:18:48] [INFO ] Invariant cache hit.
[2023-03-17 10:18:49] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 36 transitions.
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1512 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 126 out of 138 places after structural reductions.
[2023-03-17 10:18:49] [INFO ] Flatten gal took : 172 ms
[2023-03-17 10:18:49] [INFO ] Flatten gal took : 103 ms
[2023-03-17 10:18:50] [INFO ] Input system was already deterministic with 415 transitions.
Finished random walk after 6194 steps, including 1 resets, run visited all 24 properties in 210 ms. (steps per millisecond=29 )
FORMULA SafeBus-PT-06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(((!p0 U (p1||G(!p0))) U G(p0)))'
Support contains 24 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 94 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:18:51] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:18:51] [INFO ] Computed 29 place invariants in 10 ms
[2023-03-17 10:18:51] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-17 10:18:51] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:18:51] [INFO ] Invariant cache hit.
[2023-03-17 10:18:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:18:52] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2023-03-17 10:18:52] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-17 10:18:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:18:52] [INFO ] Invariant cache hit.
[2023-03-17 10:18:52] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1773 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p0), (NOT p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s84 1) (GEQ s97 1)) (AND (GEQ s85 1) (GEQ s98 1)) (AND (GEQ s82 1) (GEQ s95 1)) (AND (GEQ s83 1) (GEQ s96 1)) (AND (GEQ s86 1) (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 5 ms.
FORMULA SafeBus-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-00 finished in 2274 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((G(F(p1))&&p0))))))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:18:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:18:53] [INFO ] Invariant cache hit.
[2023-03-17 10:18:53] [INFO ] Implicit Places using invariants in 293 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 298 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (OR (LT s124 1) (LT s127 1)) (OR (LT s124 1) (LT s126 1)) (OR (LT s124 1) (LT s131 1)) (OR (LT s124 1) (LT s130 1)) (OR (LT s124 1) (LT s129 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3636 reset in 1006 ms.
Product exploration explored 100000 steps with 3631 reset in 535 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:18:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2023-03-17 10:18:57] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-17 10:18:57] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-17 10:18:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:18:57] [INFO ] Invariant cache hit.
[2023-03-17 10:18:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:18:58] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-17 10:18:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:18:58] [INFO ] Invariant cache hit.
[2023-03-17 10:18:58] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1574 ms. Remains : 132/132 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 394 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 3624 reset in 720 ms.
Product exploration explored 100000 steps with 3638 reset in 442 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 415
Deduced a syphon composed of 6 places in 2 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 132 transition count 415
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -144
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 132 transition count 559
Deduced a syphon composed of 12 places in 1 ms
Applied a total of 12 rules in 54 ms. Remains 132 /132 variables (removed 0) and now considering 559/415 (removed -144) transitions.
[2023-03-17 10:19:02] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-17 10:19:02] [INFO ] Flow matrix only has 386 transitions (discarded 173 similar events)
// Phase 1: matrix 386 rows 132 cols
[2023-03-17 10:19:02] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 10:19:02] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 559/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 578 ms. Remains : 132/132 places, 559/415 transitions.
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:02] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2023-03-17 10:19:02] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 10:19:02] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-17 10:19:02] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:02] [INFO ] Invariant cache hit.
[2023-03-17 10:19:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:03] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-17 10:19:03] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:03] [INFO ] Invariant cache hit.
[2023-03-17 10:19:03] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 132/132 places, 415/415 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-01 finished in 10672 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(F(((!p1 U (p2||G(!p1)))||p0)))))'
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:03] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:03] [INFO ] Computed 29 place invariants in 8 ms
[2023-03-17 10:19:04] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-17 10:19:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:04] [INFO ] Invariant cache hit.
[2023-03-17 10:19:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:04] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-17 10:19:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:04] [INFO ] Invariant cache hit.
[2023-03-17 10:19:05] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1176 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s110 1)) (AND (GEQ s35 1) (GEQ s109 1)) (AND (GEQ s37 1) (GEQ s111 1)) (AND (GEQ s39 1) (GEQ s113 1)) (AND (GEQ s34 1) (GEQ s...], 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 30149 reset in 441 ms.
Product exploration explored 100000 steps with 30048 reset in 411 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 277 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:06] [INFO ] Invariant cache hit.
[2023-03-17 10:19:07] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-17 10:19:07] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:07] [INFO ] Invariant cache hit.
[2023-03-17 10:19:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:08] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-17 10:19:08] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:08] [INFO ] Invariant cache hit.
[2023-03-17 10:19:08] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1726 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 257 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 30068 reset in 528 ms.
Product exploration explored 100000 steps with 30087 reset in 369 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 22 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-17 10:19:10] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:10] [INFO ] Invariant cache hit.
[2023-03-17 10:19:11] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 138/138 places, 415/415 transitions.
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:11] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:11] [INFO ] Invariant cache hit.
[2023-03-17 10:19:11] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-17 10:19:11] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:11] [INFO ] Invariant cache hit.
[2023-03-17 10:19:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:12] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2023-03-17 10:19:12] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:12] [INFO ] Invariant cache hit.
[2023-03-17 10:19:12] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1222 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-02 finished in 8724 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 50 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 22 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:12] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:12] [INFO ] Invariant cache hit.
[2023-03-17 10:19:12] [INFO ] Implicit Places using invariants in 179 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 185 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 60 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2023-03-17 10:19:12] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2023-03-17 10:19:12] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-17 10:19:12] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-17 10:19:12] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:12] [INFO ] Invariant cache hit.
[2023-03-17 10:19:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:13] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 898 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-05 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:(OR (AND (GEQ s41 1) (GEQ s56 1) (GEQ s86 1) (GEQ s88 1)) (AND (GEQ s42 1) (GEQ s59 1) (GEQ s82 1) (GEQ s88 1)) (AND (GEQ s42 1) (GEQ s58 1) (GEQ s85 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1053 ms.
Stack based approach found an accepted trace after 240 steps with 0 reset with depth 241 and stack size 241 in 2 ms.
FORMULA SafeBus-PT-06-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-05 finished in 2141 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(G(p0))))'
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:14] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:14] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-17 10:19:14] [INFO ] Implicit Places using invariants in 284 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 286 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s31 1)) (AND (GEQ s2 1) (GEQ s30 1)) (AND (GEQ s2 1) (GEQ s33 1)) (AND (GEQ s2 1) (GEQ s32 1)) (AND (GEQ s2 1) (GEQ s15 1)) (A...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-06 finished in 467 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(p1)&&p0)))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:15] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:15] [INFO ] Invariant cache hit.
[2023-03-17 10:19:15] [INFO ] Implicit Places using invariants in 220 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 223 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s86 1) (LT s99 1)), p0:(AND (GEQ s0 1) (GEQ s24 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-06-LTLFireability-09 finished in 370 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)||(F(p1)&&F(p2)))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:15] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:15] [INFO ] Invariant cache hit.
[2023-03-17 10:19:15] [INFO ] Implicit Places using invariants in 188 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 189 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s14 1)), p1:(OR (LT s1 1) (LT s35 1)), p2:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1856 reset in 463 ms.
Stack based approach found an accepted trace after 540 steps with 5 reset with depth 82 and stack size 82 in 4 ms.
FORMULA SafeBus-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-10 finished in 878 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 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 20 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:16] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:16] [INFO ] Invariant cache hit.
[2023-03-17 10:19:16] [INFO ] Implicit Places using invariants in 389 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 391 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 428
Applied a total of 14 rules in 39 ms. Remains 125 /132 variables (removed 7) and now considering 428/415 (removed -13) transitions.
[2023-03-17 10:19:16] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
// Phase 1: matrix 255 rows 125 cols
[2023-03-17 10:19:16] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-17 10:19:17] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-17 10:19:17] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
[2023-03-17 10:19:17] [INFO ] Invariant cache hit.
[2023-03-17 10:19:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:17] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/138 places, 428/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1509 ms. Remains : 125/138 places, 428/415 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s108 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]]
Product exploration explored 100000 steps with 43 reset in 512 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 111 in 1 ms.
FORMULA SafeBus-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-11 finished in 2093 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 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 25 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:18] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:18] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-17 10:19:18] [INFO ] Implicit Places using invariants in 337 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 340 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 64 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2023-03-17 10:19:18] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2023-03-17 10:19:18] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-17 10:19:19] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-17 10:19:19] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:19] [INFO ] Invariant cache hit.
[2023-03-17 10:19:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:20] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1639 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s1 1)) (OR (LT s102 1) (LT s108 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 768 ms.
Stack based approach found an accepted trace after 419 steps with 0 reset with depth 420 and stack size 405 in 4 ms.
FORMULA SafeBus-PT-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-12 finished in 2486 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((F(p0)&&!G((X(p1) U p0)))) U G(p2))))'
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:21] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:21] [INFO ] Computed 29 place invariants in 3 ms
[2023-03-17 10:19:21] [INFO ] Implicit Places using invariants in 352 ms returned [114, 115, 117, 118, 119]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 354 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 358 ms. Remains : 133/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 284 ms :[p2, p2, false, false, false]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s85 1) (GEQ s98 1)), p0:(AND (GEQ s104 1) (GEQ s114 1)), p1:(AND (GEQ s45 1) (GEQ s81 1) (GEQ s82 1) (GEQ s88 1))], nbAcceptance=2, 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 729 reset in 485 ms.
Product exploration explored 100000 steps with 705 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 682 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:19:23] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 133 cols
[2023-03-17 10:19:23] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-17 10:19:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-17 10:19:24] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 10 ms returned sat
[2023-03-17 10:19:24] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p1) p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p2)))
Knowledge based reduction with 12 factoid took 547 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-06-LTLFireability-13 finished in 3571 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 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 22 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:24] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:24] [INFO ] Computed 29 place invariants in 3 ms
[2023-03-17 10:19:25] [INFO ] Implicit Places using invariants in 421 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 423 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 428
Applied a total of 14 rules in 32 ms. Remains 125 /132 variables (removed 7) and now considering 428/415 (removed -13) transitions.
[2023-03-17 10:19:25] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
// Phase 1: matrix 255 rows 125 cols
[2023-03-17 10:19:25] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-17 10:19:25] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-17 10:19:25] [INFO ] Flow matrix only has 255 transitions (discarded 173 similar events)
[2023-03-17 10:19:25] [INFO ] Invariant cache hit.
[2023-03-17 10:19:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:25] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/138 places, 428/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1227 ms. Remains : 125/138 places, 428/415 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-14 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:(AND (GEQ s35 1) (GEQ s108 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]]
Product exploration explored 100000 steps with 44 reset in 294 ms.
Stack based approach found an accepted trace after 286 steps with 2 reset with depth 173 and stack size 173 in 1 ms.
FORMULA SafeBus-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-14 finished in 1608 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(p2)) U p0)||F(G(p3))))'
Support contains 9 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:26] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:26] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-17 10:19:26] [INFO ] Implicit Places using invariants in 305 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 307 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : SafeBus-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s32 1)), p1:(AND (GEQ s122 1) (GEQ s131 1)), p3:(OR (LT s120 1) (LT s127 1)), p2:(AND (GEQ s0 1) (GEQ s12 1) (GEQ s88 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 0 reset in 456 ms.
Stack based approach found an accepted trace after 331 steps with 0 reset with depth 332 and stack size 325 in 2 ms.
FORMULA SafeBus-PT-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-06-LTLFireability-15 finished in 962 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((G(F(p1))&&p0))))))'
Found a Shortening insensitive property : SafeBus-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:27] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:27] [INFO ] Invariant cache hit.
[2023-03-17 10:19:28] [INFO ] Implicit Places using invariants in 376 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 380 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 24 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2023-03-17 10:19:28] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2023-03-17 10:19:28] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-17 10:19:28] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-17 10:19:28] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:28] [INFO ] Invariant cache hit.
[2023-03-17 10:19:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:29] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1579 ms. Remains : 120/138 places, 523/415 transitions.
Running random walk in product with property : SafeBus-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (OR (LT s112 1) (LT s115 1)) (OR (LT s112 1) (LT s114 1)) (OR (LT s112 1) (LT s119 1)) (OR (LT s112 1) (LT s118 1)) (OR (LT s112 1) (LT s117 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4505 reset in 751 ms.
Product exploration explored 100000 steps with 4453 reset in 528 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 12 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-17 10:19:31] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:31] [INFO ] Invariant cache hit.
[2023-03-17 10:19:32] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-17 10:19:32] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:32] [INFO ] Invariant cache hit.
[2023-03-17 10:19:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:32] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-17 10:19:32] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:32] [INFO ] Invariant cache hit.
[2023-03-17 10:19:32] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1022 ms. Remains : 120/120 places, 523/523 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4490 reset in 512 ms.
Product exploration explored 100000 steps with 4462 reset in 526 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 12 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 18 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-17 10:19:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-17 10:19:35] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:35] [INFO ] Invariant cache hit.
[2023-03-17 10:19:35] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 120/120 places, 523/523 transitions.
Support contains 12 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-17 10:19:35] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:35] [INFO ] Invariant cache hit.
[2023-03-17 10:19:36] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-17 10:19:36] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:36] [INFO ] Invariant cache hit.
[2023-03-17 10:19:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:36] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-17 10:19:36] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2023-03-17 10:19:36] [INFO ] Invariant cache hit.
[2023-03-17 10:19:36] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 984 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-01 finished in 9775 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(F(((!p1 U (p2||G(!p1)))||p0)))))'
Found a Shortening insensitive property : SafeBus-PT-06-LTLFireability-02
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:37] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2023-03-17 10:19:37] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-17 10:19:37] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-17 10:19:37] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:37] [INFO ] Invariant cache hit.
[2023-03-17 10:19:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:37] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-17 10:19:37] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:37] [INFO ] Invariant cache hit.
[2023-03-17 10:19:38] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 931 ms. Remains : 138/138 places, 415/415 transitions.
Running random walk in product with property : SafeBus-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s110 1)) (AND (GEQ s35 1) (GEQ s109 1)) (AND (GEQ s37 1) (GEQ s111 1)) (AND (GEQ s39 1) (GEQ s113 1)) (AND (GEQ s34 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 30170 reset in 353 ms.
Product exploration explored 100000 steps with 30063 reset in 365 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:39] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:39] [INFO ] Invariant cache hit.
[2023-03-17 10:19:39] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-17 10:19:39] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:39] [INFO ] Invariant cache hit.
[2023-03-17 10:19:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:40] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-17 10:19:40] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:40] [INFO ] Invariant cache hit.
[2023-03-17 10:19:40] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1044 ms. Remains : 138/138 places, 415/415 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Finished random walk after 28 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 30150 reset in 323 ms.
Product exploration explored 100000 steps with 30139 reset in 339 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 10:19:42] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:42] [INFO ] Invariant cache hit.
[2023-03-17 10:19:42] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 138/138 places, 415/415 transitions.
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-17 10:19:42] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:42] [INFO ] Invariant cache hit.
[2023-03-17 10:19:42] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-17 10:19:42] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:42] [INFO ] Invariant cache hit.
[2023-03-17 10:19:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-17 10:19:43] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2023-03-17 10:19:43] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2023-03-17 10:19:43] [INFO ] Invariant cache hit.
[2023-03-17 10:19:44] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1545 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-PT-06-LTLFireability-02 finished in 7143 ms.
[2023-03-17 10:19:44] [INFO ] Flatten gal took : 43 ms
[2023-03-17 10:19:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-17 10:19:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 4 ms.
Total runtime 57185 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SafeBus-PT-06
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA SafeBus-PT-06-LTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-PT-06-LTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679048386057

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
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 # 4 (type EXCL) for 3 SafeBus-PT-06-LTLFireability-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for SafeBus-PT-06-LTLFireability-02
lola: result : true
lola: markings : 79525
lola: fired transitions : 101652
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 SafeBus-PT-06-LTLFireability-01
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SafeBus-PT-06-LTLFireability-01
lola: result : false
lola: markings : 1023
lola: fired transitions : 1193
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SafeBus-PT-06-LTLFireability-01: LTL false LTL model checker
SafeBus-PT-06-LTLFireability-02: LTL true LTL model checker


Time elapsed: 1 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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r359-smll-167891808700268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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