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.r361-smll-167891811200284.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 ltsminxred
Input is SafeBus-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811200284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 40K Feb 26 02:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 227K Feb 26 02:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 390K Feb 26 02:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Feb 26 02:08 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 31K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 271K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 797K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 83K Feb 26 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 472K Feb 26 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 725K Feb 26 02:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 26 02:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.7K 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 3.5M 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-15-LTLFireability-00
FORMULA_NAME SafeBus-PT-15-LTLFireability-01
FORMULA_NAME SafeBus-PT-15-LTLFireability-02
FORMULA_NAME SafeBus-PT-15-LTLFireability-03
FORMULA_NAME SafeBus-PT-15-LTLFireability-04
FORMULA_NAME SafeBus-PT-15-LTLFireability-05
FORMULA_NAME SafeBus-PT-15-LTLFireability-06
FORMULA_NAME SafeBus-PT-15-LTLFireability-07
FORMULA_NAME SafeBus-PT-15-LTLFireability-08
FORMULA_NAME SafeBus-PT-15-LTLFireability-09
FORMULA_NAME SafeBus-PT-15-LTLFireability-10
FORMULA_NAME SafeBus-PT-15-LTLFireability-11
FORMULA_NAME SafeBus-PT-15-LTLFireability-12
FORMULA_NAME SafeBus-PT-15-LTLFireability-13
FORMULA_NAME SafeBus-PT-15-LTLFireability-14
FORMULA_NAME SafeBus-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679173949481

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 21:12:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 21:12:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:12:33] [INFO ] Load time of PNML (sax parser for PT used): 636 ms
[2023-03-18 21:12:33] [INFO ] Transformed 621 places.
[2023-03-18 21:12:33] [INFO ] Transformed 4771 transitions.
[2023-03-18 21:12:33] [INFO ] Parsed PT model containing 621 places and 4771 transitions and 34549 arcs in 833 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 86 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 15 places and 0 transitions.
FORMULA SafeBus-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 606 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4771/4771 transitions.
Applied a total of 0 rules in 59 ms. Remains 606 /606 variables (removed 0) and now considering 4771/4771 (removed 0) transitions.
[2023-03-18 21:12:35] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:12:35] [INFO ] Computed 65 place invariants in 138 ms
[2023-03-18 21:12:35] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-18 21:12:35] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2023-03-18 21:12:35] [INFO ] Invariant cache hit.
[2023-03-18 21:12:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:12:36] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2023-03-18 21:12:36] [INFO ] Flow matrix only has 1412 transitions (discarded 3359 similar events)
[2023-03-18 21:12:36] [INFO ] Invariant cache hit.
[2023-03-18 21:12:42] [INFO ] Dead Transitions using invariants and state equation in 5602 ms found 225 transitions.
Found 225 dead transitions using SMT.
Drop transitions removed 225 transitions
Dead transitions reduction (with SMT) removed 225 transitions
Starting structural reductions in LTL mode, iteration 1 : 606/606 places, 4546/4771 transitions.
Applied a total of 0 rules in 25 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7411 ms. Remains : 606/606 places, 4546/4771 transitions.
Support contains 606 out of 606 places after structural reductions.
[2023-03-18 21:12:43] [INFO ] Flatten gal took : 761 ms
[2023-03-18 21:12:44] [INFO ] Flatten gal took : 436 ms
[2023-03-18 21:12:45] [INFO ] Input system was already deterministic with 4546 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 843 ms. (steps per millisecond=11 ) properties (out of 26) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:12:47] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:12:47] [INFO ] Computed 65 place invariants in 39 ms
[2023-03-18 21:12:47] [INFO ] [Real]Absence check using 32 positive place invariants in 21 ms returned sat
[2023-03-18 21:12:47] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 41 ms returned sat
[2023-03-18 21:12:47] [INFO ] After 327ms 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 0 ms.
FORMULA SafeBus-PT-15-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SafeBus-PT-15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 256 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1571 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:12:50] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:12:50] [INFO ] Invariant cache hit.
[2023-03-18 21:12:51] [INFO ] Implicit Places using invariants in 906 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 925 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4531
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4531
Applied a total of 30 rules in 1750 ms. Remains 576 /591 variables (removed 15) and now considering 4531/4546 (removed 15) transitions.
[2023-03-18 21:12:52] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2023-03-18 21:12:52] [INFO ] Computed 50 place invariants in 18 ms
[2023-03-18 21:12:53] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-18 21:12:53] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:12:53] [INFO ] Invariant cache hit.
[2023-03-18 21:12:54] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:12:56] [INFO ] Implicit Places using invariants and state equation in 3222 ms returned []
Implicit Place search using SMT with State Equation took 3966 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 576/606 places, 4531/4546 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8217 ms. Remains : 576/606 places, 4531/4546 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s237 1) (LT s373 1) (LT s473 1) (LT s484 1)) (OR (LT s237 1) (LT s372 1) (LT s476 1) (LT s484 1)) (OR (LT s237 1) (LT s371 1) (LT s479 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 timeout after 70180 steps with 2401 reset in 10002 ms.
Product exploration timeout after 75560 steps with 2577 reset in 10001 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 256 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 4531/4531 transitions.
Applied a total of 0 rules in 1580 ms. Remains 576 /576 variables (removed 0) and now considering 4531/4531 (removed 0) transitions.
[2023-03-18 21:13:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:13:19] [INFO ] Invariant cache hit.
[2023-03-18 21:13:20] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-18 21:13:20] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:13:20] [INFO ] Invariant cache hit.
[2023-03-18 21:13:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:13:22] [INFO ] Implicit Places using invariants and state equation in 2682 ms returned []
Implicit Place search using SMT with State Equation took 3153 ms to find 0 implicit places.
[2023-03-18 21:13:23] [INFO ] Redundant transitions in 487 ms returned []
[2023-03-18 21:13:23] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:13:23] [INFO ] Invariant cache hit.
[2023-03-18 21:13:28] [INFO ] Dead Transitions using invariants and state equation in 5681 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10914 ms. Remains : 576/576 places, 4531/4531 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 71350 steps with 2424 reset in 10001 ms.
Product exploration timeout after 72610 steps with 2490 reset in 10001 ms.
Support contains 256 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 4531/4531 transitions.
Applied a total of 0 rules in 1298 ms. Remains 576 /576 variables (removed 0) and now considering 4531/4531 (removed 0) transitions.
[2023-03-18 21:13:51] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:13:51] [INFO ] Invariant cache hit.
[2023-03-18 21:13:51] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-18 21:13:51] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:13:51] [INFO ] Invariant cache hit.
[2023-03-18 21:13:52] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:13:54] [INFO ] Implicit Places using invariants and state equation in 2780 ms returned []
Implicit Place search using SMT with State Equation took 3247 ms to find 0 implicit places.
[2023-03-18 21:13:54] [INFO ] Redundant transitions in 407 ms returned []
[2023-03-18 21:13:54] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:13:54] [INFO ] Invariant cache hit.
[2023-03-18 21:14:00] [INFO ] Dead Transitions using invariants and state equation in 5268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10232 ms. Remains : 576/576 places, 4531/4531 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-01 finished in 72718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U !p2)||X(F((p1&&X(F(p3)))))||p0))))'
Support contains 61 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1788 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:14:02] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:14:03] [INFO ] Computed 65 place invariants in 29 ms
[2023-03-18 21:14:04] [INFO ] Implicit Places using invariants in 1902 ms returned []
[2023-03-18 21:14:04] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:14:04] [INFO ] Invariant cache hit.
[2023-03-18 21:14:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:14:12] [INFO ] Implicit Places using invariants and state equation in 7960 ms returned []
Implicit Place search using SMT with State Equation took 9870 ms to find 0 implicit places.
[2023-03-18 21:14:13] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-18 21:14:13] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:14:13] [INFO ] Invariant cache hit.
[2023-03-18 21:14:17] [INFO ] Dead Transitions using invariants and state equation in 4704 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16617 ms. Remains : 606/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (AND (GEQ s1 1) (GEQ s227 1)) (AND (GEQ s1 1) (GEQ s228 1)) (AND (GEQ s1 1) (GEQ s225 1)) (AND (GEQ s1 1) (GEQ s226 1)) (AND (GEQ s1 1) (GEQ s223 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8904 reset in 3937 ms.
Product exploration explored 100000 steps with 8913 reset in 3744 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 p3) (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p3) p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) p0 (NOT p1) p2))), (X (AND (NOT p3) (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p3) (NOT p0) p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p0 p1 p2))), (X (X (NOT (AND (NOT p3) p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 11 factoid took 1022 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:14:28] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:14:28] [INFO ] Invariant cache hit.
[2023-03-18 21:14:29] [INFO ] After 91ms 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 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p3) p0 p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) p0 (NOT p1) p2))), (X (AND (NOT p3) (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p3) (NOT p0) p1 p2))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 p2)))), (G (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (G (NOT (AND p1 p2 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p0 p1 p2))), (X (X (NOT (AND (NOT p3) p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1) p2)))), (F (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3)))), (F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p0))), (F (AND p1 p2 p0 (NOT p3))), (F (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 13 factoid took 1002 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2 (NOT p0))]
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2 (NOT p0))]
[2023-03-18 21:14:30] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:14:31] [INFO ] Invariant cache hit.
[2023-03-18 21:14:43] [INFO ] [Real]Absence check using 32 positive place invariants in 58 ms returned sat
[2023-03-18 21:14:43] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 168 ms returned sat
[2023-03-18 21:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:14:46] [INFO ] [Real]Absence check using state equation in 2342 ms returned unknown
Could not prove EG (AND (NOT p1) p2 (NOT p3))
[2023-03-18 21:14:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:14:46] [INFO ] Invariant cache hit.
[2023-03-18 21:14:59] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2023-03-18 21:14:59] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 556 ms returned sat
[2023-03-18 21:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:15:01] [INFO ] [Real]Absence check using state equation in 1833 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p2)
Support contains 61 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1766 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:15:03] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:15:03] [INFO ] Invariant cache hit.
[2023-03-18 21:15:05] [INFO ] Implicit Places using invariants in 2274 ms returned []
[2023-03-18 21:15:05] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:15:05] [INFO ] Invariant cache hit.
[2023-03-18 21:15:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:15:14] [INFO ] Implicit Places using invariants and state equation in 8809 ms returned []
Implicit Place search using SMT with State Equation took 11084 ms to find 0 implicit places.
[2023-03-18 21:15:14] [INFO ] Redundant transitions in 256 ms returned []
[2023-03-18 21:15:14] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:15:14] [INFO ] Invariant cache hit.
[2023-03-18 21:15:20] [INFO ] Dead Transitions using invariants and state equation in 6085 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19210 ms. Remains : 606/606 places, 4546/4546 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 p1) p2 (NOT p3) (NOT p0)), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (AND (NOT p1) p2 (NOT p3))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
Knowledge based reduction with 6 factoid took 447 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2 (NOT p0))]
Finished random walk after 20 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p3) (NOT p0)), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (AND (NOT p1) p2 (NOT p3))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2 (NOT p3)))), (F (OR (AND p1 (NOT p3)) (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 722 ms. Reduced automaton from 3 states, 7 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2 (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2 (NOT p0))]
[2023-03-18 21:15:22] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:15:23] [INFO ] Invariant cache hit.
[2023-03-18 21:15:35] [INFO ] [Real]Absence check using 32 positive place invariants in 59 ms returned sat
[2023-03-18 21:15:35] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 172 ms returned sat
[2023-03-18 21:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:15:38] [INFO ] [Real]Absence check using state equation in 2806 ms returned unknown
Could not prove EG (AND (NOT p1) p2 (NOT p3))
[2023-03-18 21:15:38] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:15:38] [INFO ] Invariant cache hit.
[2023-03-18 21:15:50] [INFO ] [Real]Absence check using 32 positive place invariants in 54 ms returned sat
[2023-03-18 21:15:50] [INFO ] [Real]Absence check using 32 positive and 33 generalized place invariants in 557 ms returned sat
[2023-03-18 21:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:15:53] [INFO ] [Real]Absence check using state equation in 2520 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p2)
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p1) p2 (NOT p0))]
Product exploration explored 100000 steps with 8990 reset in 3727 ms.
Product exploration explored 100000 steps with 8924 reset in 3564 ms.
Support contains 61 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1761 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:16:02] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:02] [INFO ] Invariant cache hit.
[2023-03-18 21:16:04] [INFO ] Implicit Places using invariants in 1515 ms returned []
[2023-03-18 21:16:04] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:04] [INFO ] Invariant cache hit.
[2023-03-18 21:16:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:16:10] [INFO ] Implicit Places using invariants and state equation in 6758 ms returned []
Implicit Place search using SMT with State Equation took 8276 ms to find 0 implicit places.
[2023-03-18 21:16:11] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-18 21:16:11] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:11] [INFO ] Invariant cache hit.
[2023-03-18 21:16:15] [INFO ] Dead Transitions using invariants and state equation in 4346 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14633 ms. Remains : 606/606 places, 4546/4546 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-02 finished in 134622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)))))'
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 35 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:16:15] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:15] [INFO ] Invariant cache hit.
[2023-03-18 21:16:18] [INFO ] Implicit Places using invariants in 2543 ms returned []
[2023-03-18 21:16:18] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:18] [INFO ] Invariant cache hit.
[2023-03-18 21:16:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:16:26] [INFO ] Implicit Places using invariants and state equation in 7707 ms returned []
Implicit Place search using SMT with State Equation took 10253 ms to find 0 implicit places.
[2023-03-18 21:16:26] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:26] [INFO ] Invariant cache hit.
[2023-03-18 21:16:31] [INFO ] Dead Transitions using invariants and state equation in 5088 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15377 ms. Remains : 606/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s3 1) (LT s514 1)) (OR (LT s3 1) (LT s513 1)) (OR (LT s3 1) (LT s512 1)) (OR (LT s3 1) (LT s511 1)) (OR (LT s3 1) (LT s510 1)) (OR (LT s3 ...], 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 10138 reset in 2142 ms.
Product exploration explored 100000 steps with 10040 reset in 2085 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 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 50 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 51 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:16:36] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:36] [INFO ] Invariant cache hit.
[2023-03-18 21:16:38] [INFO ] Implicit Places using invariants in 2397 ms returned []
[2023-03-18 21:16:38] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:38] [INFO ] Invariant cache hit.
[2023-03-18 21:16:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:16:46] [INFO ] Implicit Places using invariants and state equation in 7503 ms returned []
Implicit Place search using SMT with State Equation took 9902 ms to find 0 implicit places.
[2023-03-18 21:16:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:46] [INFO ] Invariant cache hit.
[2023-03-18 21:16:51] [INFO ] Dead Transitions using invariants and state equation in 5383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15338 ms. Remains : 606/606 places, 4546/4546 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 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 40 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10059 reset in 1892 ms.
Product exploration explored 100000 steps with 10119 reset in 1916 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1108 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:16:57] [INFO ] Redundant transitions in 246 ms returned []
[2023-03-18 21:16:57] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:16:57] [INFO ] Invariant cache hit.
[2023-03-18 21:17:03] [INFO ] Dead Transitions using invariants and state equation in 5535 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6902 ms. Remains : 606/606 places, 4546/4546 transitions.
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 34 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:17:03] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:03] [INFO ] Invariant cache hit.
[2023-03-18 21:17:05] [INFO ] Implicit Places using invariants in 2146 ms returned []
[2023-03-18 21:17:05] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:05] [INFO ] Invariant cache hit.
[2023-03-18 21:17:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:17:12] [INFO ] Implicit Places using invariants and state equation in 7159 ms returned []
Implicit Place search using SMT with State Equation took 9307 ms to find 0 implicit places.
[2023-03-18 21:17:12] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:12] [INFO ] Invariant cache hit.
[2023-03-18 21:17:17] [INFO ] Dead Transitions using invariants and state equation in 4556 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13899 ms. Remains : 606/606 places, 4546/4546 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-03 finished in 61858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U X((F(p1)&&(X(p0)||p2)))))'
Support contains 302 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 15 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:17:17] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:17] [INFO ] Invariant cache hit.
[2023-03-18 21:17:18] [INFO ] Implicit Places using invariants in 1086 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1096 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 24 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1135 ms. Remains : 591/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s226 1) (GEQ s558 1)) (AND (GEQ s218 1) (GEQ s550 1)) (AND (GEQ s215 1) (GEQ s547 1)) (AND (GEQ s219 1) (GEQ s551 1)) (AND (GEQ s221 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2617 reset in 2504 ms.
Product exploration explored 100000 steps with 2597 reset in 2031 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) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 534 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 46 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X p2), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F p1), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 577 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-18 21:17:25] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2023-03-18 21:17:25] [INFO ] Computed 50 place invariants in 44 ms
[2023-03-18 21:17:32] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2023-03-18 21:17:32] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 74 ms returned sat
[2023-03-18 21:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:17:35] [INFO ] [Real]Absence check using state equation in 2973 ms returned sat
[2023-03-18 21:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:17:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 57 ms returned sat
[2023-03-18 21:17:43] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 372 ms returned sat
[2023-03-18 21:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:17:44] [INFO ] [Nat]Absence check using state equation in 1630 ms returned sat
[2023-03-18 21:17:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:17:46] [INFO ] [Nat]Added 241 Read/Feed constraints in 1238 ms returned sat
[2023-03-18 21:17:46] [INFO ] Deduced a trap composed of 61 places in 376 ms of which 9 ms to minimize.
[2023-03-18 21:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 590 ms
[2023-03-18 21:17:47] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 480 ms.
[2023-03-18 21:17:47] [INFO ] Added : 4 causal constraints over 3 iterations in 1069 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 272 out of 591 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 15 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:17:47] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:47] [INFO ] Invariant cache hit.
[2023-03-18 21:17:48] [INFO ] Implicit Places using invariants in 742 ms returned []
[2023-03-18 21:17:48] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:48] [INFO ] Invariant cache hit.
[2023-03-18 21:17:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:17:52] [INFO ] Implicit Places using invariants and state equation in 3882 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
[2023-03-18 21:17:52] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:52] [INFO ] Invariant cache hit.
[2023-03-18 21:17:57] [INFO ] Dead Transitions using invariants and state equation in 4811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9458 ms. Remains : 591/591 places, 4546/4546 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 p1) (NOT p2)), (X (NOT p1)), (X p2), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X p2), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p1), (F p2)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 354 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-18 21:17:58] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:17:58] [INFO ] Invariant cache hit.
[2023-03-18 21:18:04] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2023-03-18 21:18:05] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 120 ms returned sat
[2023-03-18 21:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:18:09] [INFO ] [Real]Absence check using state equation in 4457 ms returned sat
[2023-03-18 21:18:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:18:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 89 ms returned sat
[2023-03-18 21:18:16] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 166 ms returned sat
[2023-03-18 21:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:18:18] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2023-03-18 21:18:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:18:19] [INFO ] [Nat]Added 241 Read/Feed constraints in 688 ms returned sat
[2023-03-18 21:18:19] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 2 ms to minimize.
[2023-03-18 21:18:20] [INFO ] Deduced a trap composed of 74 places in 425 ms of which 3 ms to minimize.
[2023-03-18 21:18:22] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 2 ms to minimize.
[2023-03-18 21:18:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2911 ms
[2023-03-18 21:18:22] [INFO ] Computed and/alt/rep : 30/45/30 causal constraints (skipped 1367 transitions) in 275 ms.
[2023-03-18 21:18:23] [INFO ] Added : 2 causal constraints over 2 iterations in 730 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2605 reset in 2015 ms.
Product exploration explored 100000 steps with 2575 reset in 2018 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 272 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4546
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 591 transition count 4546
Deduced a syphon composed of 15 places in 3 ms
Applied a total of 15 rules in 1379 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:18:29] [INFO ] Redundant transitions in 244 ms returned []
[2023-03-18 21:18:29] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2023-03-18 21:18:29] [INFO ] Computed 50 place invariants in 15 ms
[2023-03-18 21:18:33] [INFO ] Dead Transitions using invariants and state equation in 4354 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/591 places, 4546/4546 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5985 ms. Remains : 591/591 places, 4546/4546 transitions.
Support contains 272 out of 591 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 591/591 places, 4546/4546 transitions.
Applied a total of 0 rules in 20 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:18:33] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 591 cols
[2023-03-18 21:18:33] [INFO ] Computed 50 place invariants in 16 ms
[2023-03-18 21:18:34] [INFO ] Implicit Places using invariants in 1169 ms returned []
[2023-03-18 21:18:34] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:18:34] [INFO ] Invariant cache hit.
[2023-03-18 21:18:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:18:38] [INFO ] Implicit Places using invariants and state equation in 4311 ms returned []
Implicit Place search using SMT with State Equation took 5482 ms to find 0 implicit places.
[2023-03-18 21:18:38] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:18:38] [INFO ] Invariant cache hit.
[2023-03-18 21:18:43] [INFO ] Dead Transitions using invariants and state equation in 4402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9906 ms. Remains : 591/591 places, 4546/4546 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-05 finished in 85938 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))||G(p1)) U G(p2)))'
Support contains 257 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1724 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:18:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:18:45] [INFO ] Computed 65 place invariants in 18 ms
[2023-03-18 21:18:47] [INFO ] Implicit Places using invariants in 2018 ms returned []
[2023-03-18 21:18:47] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:18:47] [INFO ] Invariant cache hit.
[2023-03-18 21:18:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:18:54] [INFO ] Implicit Places using invariants and state equation in 7440 ms returned []
Implicit Place search using SMT with State Equation took 9461 ms to find 0 implicit places.
[2023-03-18 21:18:55] [INFO ] Redundant transitions in 271 ms returned []
[2023-03-18 21:18:55] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:18:55] [INFO ] Invariant cache hit.
[2023-03-18 21:19:00] [INFO ] Dead Transitions using invariants and state equation in 5774 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17243 ms. Remains : 606/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (NOT (OR (AND (GEQ s485 1) (GEQ s546 1)) (AND (GEQ s486 1) (GEQ s547 1)) (AND (GEQ s488 1) (GEQ s549 1)) (AND (GEQ s491 1) (GEQ s552 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 33013 reset in 2404 ms.
Product exploration explored 100000 steps with 33042 reset in 2401 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 p2 p0 (NOT p1)), (X p2), (X (OR (AND p2 p0) (AND p0 p1))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X (AND p2 p0 (NOT p1))), (X p0), (X (X p2)), (X (X (OR (AND p2 p0) (AND p0 p1)))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1105 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), p0, (OR (AND p0 p2) (AND p0 p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:19:08] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:08] [INFO ] Invariant cache hit.
[2023-03-18 21:19:09] [INFO ] After 108ms 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 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p2 p0) (AND p0 p1))), (X (OR p2 p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1))), (X (AND p2 p0 (NOT p1))), (X p0), (X (X p2)), (X (X (OR (AND p2 p0) (AND p0 p1)))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 p0 (NOT p1)))), (X (X p0)), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p2) p1 p0)))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (AND p2 p0) (AND p1 p0)))), (F (NOT p0)), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1) p0)), (F (NOT (AND p2 (NOT p1) p0))), (F (NOT (OR p2 p1))), (F (AND p2 p1))]
Knowledge based reduction with 25 factoid took 1267 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), p0, (AND p0 p2)]
Support contains 257 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1549 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:19:12] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:12] [INFO ] Invariant cache hit.
[2023-03-18 21:19:14] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2023-03-18 21:19:14] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:14] [INFO ] Invariant cache hit.
[2023-03-18 21:19:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:19:20] [INFO ] Implicit Places using invariants and state equation in 6275 ms returned []
Implicit Place search using SMT with State Equation took 7571 ms to find 0 implicit places.
[2023-03-18 21:19:20] [INFO ] Redundant transitions in 247 ms returned []
[2023-03-18 21:19:20] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:20] [INFO ] Invariant cache hit.
[2023-03-18 21:19:24] [INFO ] Dead Transitions using invariants and state equation in 4175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13551 ms. Remains : 606/606 places, 4546/4546 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 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 335 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), p0, (AND p0 p2)]
Finished random walk after 30 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p2 p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p2 p0))), (F (NOT p2)), (F (NOT p0)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 9 factoid took 549 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), p0, (AND p0 p2)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), p0, (AND p0 p2)]
Product exploration explored 100000 steps with 3069 reset in 1451 ms.
Product exploration explored 100000 steps with 3061 reset in 1417 ms.
Support contains 257 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1530 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:19:30] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:30] [INFO ] Invariant cache hit.
[2023-03-18 21:19:32] [INFO ] Implicit Places using invariants in 1808 ms returned []
[2023-03-18 21:19:32] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:32] [INFO ] Invariant cache hit.
[2023-03-18 21:19:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:19:39] [INFO ] Implicit Places using invariants and state equation in 6994 ms returned []
Implicit Place search using SMT with State Equation took 8806 ms to find 0 implicit places.
[2023-03-18 21:19:39] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-18 21:19:39] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:39] [INFO ] Invariant cache hit.
[2023-03-18 21:19:45] [INFO ] Dead Transitions using invariants and state equation in 5550 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16142 ms. Remains : 606/606 places, 4546/4546 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-06 finished in 61990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 212 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 31 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:19:45] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:45] [INFO ] Invariant cache hit.
[2023-03-18 21:19:47] [INFO ] Implicit Places using invariants in 1495 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1502 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 28 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1563 ms. Remains : 591/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s147 1) (LT s484 1)) (OR (LT s0 1) (LT s49 1) (LT s484 1)) (OR (LT s0 1) (LT s118 1) (LT s484 1)) (OR (LT s0 1) (LT s60 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-15-LTLFireability-07 finished in 1664 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&&F(!p2)) U p1)))'
Support contains 6 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1228 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:19:48] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:19:48] [INFO ] Invariant cache hit.
[2023-03-18 21:19:50] [INFO ] Implicit Places using invariants in 2131 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2140 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 591 transition count 4532
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 577 transition count 4532
Applied a total of 28 rules in 1573 ms. Remains 577 /591 variables (removed 14) and now considering 4532/4546 (removed 14) transitions.
[2023-03-18 21:19:52] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
// Phase 1: matrix 1398 rows 577 cols
[2023-03-18 21:19:52] [INFO ] Computed 50 place invariants in 15 ms
[2023-03-18 21:19:54] [INFO ] Implicit Places using invariants in 1923 ms returned []
[2023-03-18 21:19:54] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:19:54] [INFO ] Invariant cache hit.
[2023-03-18 21:19:55] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:20:00] [INFO ] Implicit Places using invariants and state equation in 6356 ms returned []
Implicit Place search using SMT with State Equation took 8283 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 577/606 places, 4532/4546 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13225 ms. Remains : 577/606 places, 4532/4546 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p2, (NOT p1)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(AND (GEQ s226 1) (GEQ s546 1)), p2:(AND (GEQ s539 1) (GEQ s547 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3059 reset in 1436 ms.
Stack based approach found an accepted trace after 81908 steps with 2407 reset with depth 181 and stack size 181 in 1117 ms.
FORMULA SafeBus-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-15-LTLFireability-08 finished in 15908 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(!X(G((!(X(p1)&&p0)&&X(p1)))))) U p2))'
Support contains 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 32 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:20:03] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:20:03] [INFO ] Computed 65 place invariants in 16 ms
[2023-03-18 21:20:05] [INFO ] Implicit Places using invariants in 2551 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2557 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 49 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2639 ms. Remains : 591/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (AND (NOT p0) p1), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s1 1)), p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(AND (GEQ s1 1) (GEQ s219 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 1264 reset in 1570 ms.
Stack based approach found an accepted trace after 64018 steps with 836 reset with depth 212 and stack size 212 in 743 ms.
FORMULA SafeBus-PT-15-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-15-LTLFireability-09 finished in 5193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 32 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:20:08] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:20:08] [INFO ] Invariant cache hit.
[2023-03-18 21:20:10] [INFO ] Implicit Places using invariants in 2191 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2198 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 49 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2279 ms. Remains : 591/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s122 1) (LT s484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1190 ms.
Product exploration explored 100000 steps with 50000 reset in 954 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-15-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-15-LTLFireability-12 finished in 4626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(p1))))'
Support contains 4 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1010 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:20:13] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:20:13] [INFO ] Invariant cache hit.
[2023-03-18 21:20:16] [INFO ] Implicit Places using invariants in 2215 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2223 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 591 transition count 4531
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 576 transition count 4531
Applied a total of 30 rules in 1321 ms. Remains 576 /591 variables (removed 15) and now considering 4531/4546 (removed 15) transitions.
[2023-03-18 21:20:17] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
// Phase 1: matrix 1397 rows 576 cols
[2023-03-18 21:20:17] [INFO ] Computed 50 place invariants in 12 ms
[2023-03-18 21:20:19] [INFO ] Implicit Places using invariants in 1878 ms returned []
[2023-03-18 21:20:19] [INFO ] Flow matrix only has 1397 transitions (discarded 3134 similar events)
[2023-03-18 21:20:19] [INFO ] Invariant cache hit.
[2023-03-18 21:20:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:20:27] [INFO ] Implicit Places using invariants and state equation in 7629 ms returned []
Implicit Place search using SMT with State Equation took 9510 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 576/606 places, 4531/4546 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14065 ms. Remains : 576/606 places, 4531/4546 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s505 1)), p1:(AND (GEQ s555 1) (GEQ s573 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 53 reset in 2163 ms.
Stack based approach found an accepted trace after 2336 steps with 0 reset with depth 2337 and stack size 2326 in 41 ms.
FORMULA SafeBus-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-15-LTLFireability-13 finished in 16429 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 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 33 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:20:29] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:20:29] [INFO ] Computed 65 place invariants in 16 ms
[2023-03-18 21:20:31] [INFO ] Implicit Places using invariants in 1870 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1876 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 591/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 50 ms. Remains 591 /591 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1959 ms. Remains : 591/606 places, 4546/4546 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-14 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:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, 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-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-15-LTLFireability-14 finished in 2259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1373 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:20:33] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:20:33] [INFO ] Invariant cache hit.
[2023-03-18 21:20:35] [INFO ] Implicit Places using invariants in 1961 ms returned [546, 547, 548, 549, 550, 551, 552, 554, 555, 556, 557, 558, 559, 560]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1968 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/606 places, 4546/4546 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 592 transition count 4532
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 578 transition count 4532
Applied a total of 28 rules in 1235 ms. Remains 578 /592 variables (removed 14) and now considering 4532/4546 (removed 14) transitions.
[2023-03-18 21:20:36] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
// Phase 1: matrix 1398 rows 578 cols
[2023-03-18 21:20:36] [INFO ] Computed 51 place invariants in 16 ms
[2023-03-18 21:20:38] [INFO ] Implicit Places using invariants in 2286 ms returned []
[2023-03-18 21:20:38] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:20:38] [INFO ] Invariant cache hit.
[2023-03-18 21:20:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:20:46] [INFO ] Implicit Places using invariants and state equation in 8014 ms returned []
Implicit Place search using SMT with State Equation took 10306 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 578/606 places, 4532/4546 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14885 ms. Remains : 578/606 places, 4532/4546 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s505 1)), p1:(OR (LT s492 1) (LT s546 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1404 reset in 1402 ms.
Product exploration explored 100000 steps with 1330 reset in 1384 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 121 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 4532/4532 transitions.
Applied a total of 0 rules in 1052 ms. Remains 578 /578 variables (removed 0) and now considering 4532/4532 (removed 0) transitions.
[2023-03-18 21:20:51] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:20:51] [INFO ] Invariant cache hit.
[2023-03-18 21:20:52] [INFO ] Implicit Places using invariants in 1629 ms returned []
[2023-03-18 21:20:52] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:20:52] [INFO ] Invariant cache hit.
[2023-03-18 21:20:53] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:21:00] [INFO ] Implicit Places using invariants and state equation in 7652 ms returned []
Implicit Place search using SMT with State Equation took 9283 ms to find 0 implicit places.
[2023-03-18 21:21:00] [INFO ] Redundant transitions in 396 ms returned []
[2023-03-18 21:21:00] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:21:00] [INFO ] Invariant cache hit.
[2023-03-18 21:21:04] [INFO ] Dead Transitions using invariants and state equation in 3035 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13779 ms. Remains : 578/578 places, 4532/4532 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 607 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 396 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1303 reset in 1630 ms.
Product exploration explored 100000 steps with 1372 reset in 1353 ms.
Support contains 4 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 4532/4532 transitions.
Applied a total of 0 rules in 1060 ms. Remains 578 /578 variables (removed 0) and now considering 4532/4532 (removed 0) transitions.
[2023-03-18 21:21:09] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:21:09] [INFO ] Invariant cache hit.
[2023-03-18 21:21:11] [INFO ] Implicit Places using invariants in 1827 ms returned []
[2023-03-18 21:21:11] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:21:11] [INFO ] Invariant cache hit.
[2023-03-18 21:21:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:21:19] [INFO ] Implicit Places using invariants and state equation in 8068 ms returned []
Implicit Place search using SMT with State Equation took 9896 ms to find 0 implicit places.
[2023-03-18 21:21:19] [INFO ] Redundant transitions in 338 ms returned []
[2023-03-18 21:21:19] [INFO ] Flow matrix only has 1398 transitions (discarded 3134 similar events)
[2023-03-18 21:21:19] [INFO ] Invariant cache hit.
[2023-03-18 21:21:24] [INFO ] Dead Transitions using invariants and state equation in 4773 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16076 ms. Remains : 578/578 places, 4532/4532 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-15 finished in 52926 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U !p2)||X(F((p1&&X(F(p3)))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||X(p1)))))'
Found a Shortening insensitive property : SafeBus-PT-15-LTLFireability-03
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 97 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:21:25] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
// Phase 1: matrix 1412 rows 606 cols
[2023-03-18 21:21:25] [INFO ] Computed 65 place invariants in 43 ms
[2023-03-18 21:21:27] [INFO ] Implicit Places using invariants in 2500 ms returned []
[2023-03-18 21:21:27] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:21:27] [INFO ] Invariant cache hit.
[2023-03-18 21:21:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:21:35] [INFO ] Implicit Places using invariants and state equation in 7773 ms returned []
Implicit Place search using SMT with State Equation took 10276 ms to find 0 implicit places.
[2023-03-18 21:21:35] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:21:35] [INFO ] Invariant cache hit.
[2023-03-18 21:21:41] [INFO ] Dead Transitions using invariants and state equation in 5911 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16289 ms. Remains : 606/606 places, 4546/4546 transitions.
Running random walk in product with property : SafeBus-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s3 1) (LT s514 1)) (OR (LT s3 1) (LT s513 1)) (OR (LT s3 1) (LT s512 1)) (OR (LT s3 1) (LT s511 1)) (OR (LT s3 1) (LT s510 1)) (OR (LT s3 ...], 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 10123 reset in 2033 ms.
Product exploration explored 100000 steps with 10192 reset in 2060 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 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 46 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 33 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:21:46] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:21:46] [INFO ] Invariant cache hit.
[2023-03-18 21:21:47] [INFO ] Implicit Places using invariants in 1635 ms returned []
[2023-03-18 21:21:47] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:21:47] [INFO ] Invariant cache hit.
[2023-03-18 21:21:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:21:54] [INFO ] Implicit Places using invariants and state equation in 6853 ms returned []
Implicit Place search using SMT with State Equation took 8491 ms to find 0 implicit places.
[2023-03-18 21:21:54] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:21:54] [INFO ] Invariant cache hit.
[2023-03-18 21:22:00] [INFO ] Dead Transitions using invariants and state equation in 6229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14754 ms. Remains : 606/606 places, 4546/4546 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 p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 41 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10036 reset in 2052 ms.
Product exploration explored 100000 steps with 10084 reset in 2063 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 1106 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:22:07] [INFO ] Redundant transitions in 250 ms returned []
[2023-03-18 21:22:07] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:22:07] [INFO ] Invariant cache hit.
[2023-03-18 21:22:11] [INFO ] Dead Transitions using invariants and state equation in 4296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5662 ms. Remains : 606/606 places, 4546/4546 transitions.
Support contains 76 out of 606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 606/606 places, 4546/4546 transitions.
Applied a total of 0 rules in 32 ms. Remains 606 /606 variables (removed 0) and now considering 4546/4546 (removed 0) transitions.
[2023-03-18 21:22:11] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:22:11] [INFO ] Invariant cache hit.
[2023-03-18 21:22:13] [INFO ] Implicit Places using invariants in 1722 ms returned []
[2023-03-18 21:22:13] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:22:13] [INFO ] Invariant cache hit.
[2023-03-18 21:22:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-18 21:22:20] [INFO ] Implicit Places using invariants and state equation in 7211 ms returned []
Implicit Place search using SMT with State Equation took 8935 ms to find 0 implicit places.
[2023-03-18 21:22:20] [INFO ] Flow matrix only has 1412 transitions (discarded 3134 similar events)
[2023-03-18 21:22:20] [INFO ] Invariant cache hit.
[2023-03-18 21:22:26] [INFO ] Dead Transitions using invariants and state equation in 5297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14266 ms. Remains : 606/606 places, 4546/4546 transitions.
Treatment of property SafeBus-PT-15-LTLFireability-03 finished in 61422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(p1)) U X((F(p1)&&(X(p0)||p2)))))'
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))||G(p1)) U G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
[2023-03-18 21:22:26] [INFO ] Flatten gal took : 304 ms
[2023-03-18 21:22:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 81 ms.
[2023-03-18 21:22:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 606 places, 4546 transitions and 32329 arcs took 35 ms.
Total runtime 594009 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2467/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393216 kB
MemFree: 11421232 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16065604 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2467/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393216 kB
MemFree: 765032 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16056144 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2467/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393216 kB
MemFree: 150260 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16296716 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2467/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 595 seconds
MemTotal: 16393216 kB
MemFree: 14719060 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16262292 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2467/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2467/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SafeBus-PT-15-LTLFireability-01
Could not compute solution for formula : SafeBus-PT-15-LTLFireability-02
Could not compute solution for formula : SafeBus-PT-15-LTLFireability-03
Could not compute solution for formula : SafeBus-PT-15-LTLFireability-05
Could not compute solution for formula : SafeBus-PT-15-LTLFireability-06
Could not compute solution for formula : SafeBus-PT-15-LTLFireability-15

BK_STOP 1679176947853

--------------------
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
mcc2023
ltl formula name SafeBus-PT-15-LTLFireability-01
ltl formula formula --ltl=/tmp/2467/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 4546 transitions and 32329 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.180 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_0_
Killing (15) : 2473 2474 2475 2476 2477
Killing (9) : 2473 2474 2475 2476 2477
ltl formula name SafeBus-PT-15-LTLFireability-02
ltl formula formula --ltl=/tmp/2467/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 4546 transitions and 32329 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.160 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_1_
Killing (15) : 2601 2602 2603 2604 2605
Killing (9) : 2601 2602 2603 2604 2605
ltl formula name SafeBus-PT-15-LTLFireability-03
ltl formula formula --ltl=/tmp/2467/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 4546 transitions and 32329 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.180 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_2_
Killing (15) : 2617 2618 2619 2620 2621
Killing (9) : 2617 2618 2619 2620 2621
ltl formula name SafeBus-PT-15-LTLFireability-05
ltl formula formula --ltl=/tmp/2467/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 4546 transitions and 32329 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.170 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_3_
Killing (15) : 2635 2636 2637 2638 2639
Killing (9) : 2635 2636 2637 2638 2639
ltl formula name SafeBus-PT-15-LTLFireability-06
ltl formula formula --ltl=/tmp/2467/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 4546 transitions and 32329 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.170 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_4_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name SafeBus-PT-15-LTLFireability-15
ltl formula formula --ltl=/tmp/2467/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 606 places, 4546 transitions and 32329 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.170 user 0.190 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2467/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2467/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2467/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2467/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SafeBus-PT-15, 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 r361-smll-167891811200284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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