Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694300155.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BridgeAndVehicles-COL-V80P50N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694300155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.4K Feb 25 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 47K Mar 5 18:22 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 BridgeAndVehicles-COL-V80P50N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678611169521

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:52:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 08:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:52:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 08:52:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 08:52:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 533 ms
[2023-03-12 08:52:51] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 228 PT places and 1339138.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 08:52:52] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-12 08:52:52] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 08:52:52] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 08:52:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 08:52:53] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-12 08:52:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 08:52:53] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-12 08:52:53] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 08:52:53] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 250 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=41 )
Parikh walk visited 3 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2023-03-12 08:52:53] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-12 08:52:53] [INFO ] Flatten gal took : 22 ms
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 08:52:53] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 08:52:53] [INFO ] Unfolded HLPN to a Petri net with 228 places and 8588 transitions 67470 arcs in 238 ms.
[2023-03-12 08:52:53] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 15 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 195 ms. Remains 228 /228 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:52:53] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 228 cols
[2023-03-12 08:52:54] [INFO ] Computed 7 place invariants in 63 ms
[2023-03-12 08:52:56] [INFO ] Dead Transitions using invariants and state equation in 2933 ms found 0 transitions.
[2023-03-12 08:52:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:52:56] [INFO ] Invariant cache hit.
[2023-03-12 08:52:57] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-12 08:52:57] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:52:57] [INFO ] Invariant cache hit.
[2023-03-12 08:52:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:52:59] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
[2023-03-12 08:52:59] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:52:59] [INFO ] Invariant cache hit.
[2023-03-12 08:53:02] [INFO ] Dead Transitions using invariants and state equation in 3009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8587 ms. Remains : 228/228 places, 8588/8588 transitions.
Support contains 15 out of 228 places after structural reductions.
[2023-03-12 08:53:02] [INFO ] Flatten gal took : 464 ms
[2023-03-12 08:53:03] [INFO ] Flatten gal took : 349 ms
[2023-03-12 08:53:04] [INFO ] Input system was already deterministic with 8588 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10045 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-12 08:53:04] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:04] [INFO ] Invariant cache hit.
[2023-03-12 08:53:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-12 08:53:05] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 11110 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.94 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(p1)&&p0))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 8588
Applied a total of 1 rules in 302 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:53:05] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 08:53:05] [INFO ] Computed 6 place invariants in 20 ms
[2023-03-12 08:53:08] [INFO ] Dead Transitions using invariants and state equation in 2994 ms found 0 transitions.
[2023-03-12 08:53:08] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:08] [INFO ] Invariant cache hit.
[2023-03-12 08:53:09] [INFO ] Implicit Places using invariants in 1083 ms returned []
[2023-03-12 08:53:09] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:09] [INFO ] Invariant cache hit.
[2023-03-12 08:53:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:53:14] [INFO ] Implicit Places using invariants and state equation in 4887 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6000 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 68 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9366 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 1 s166) (GT 2 s167)), p1:(GT 2 s167)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2544 ms.
Product exploration explored 100000 steps with 33333 reset in 2246 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 10781 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.100 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-01 finished in 15066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))||G(p2)))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 8588
Applied a total of 1 rules in 88 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:53:20] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:20] [INFO ] Invariant cache hit.
[2023-03-12 08:53:23] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
[2023-03-12 08:53:23] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:23] [INFO ] Invariant cache hit.
[2023-03-12 08:53:24] [INFO ] Implicit Places using invariants in 1195 ms returned []
[2023-03-12 08:53:24] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:24] [INFO ] Invariant cache hit.
[2023-03-12 08:53:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:53:27] [INFO ] Implicit Places using invariants and state equation in 2747 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3960 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 56 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6885 ms. Remains : 226/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT s166 s168), p1:(GT 1 s83), p2:(GT s82 s165)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17115 reset in 1988 ms.
Product exploration explored 100000 steps with 17057 reset in 2015 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.39 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 20 factoid took 1254 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Finished random walk after 4746 steps, including 7 resets, run visited all 11 properties in 137 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2))), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1613 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 53 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:53:35] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 08:53:35] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-12 08:53:37] [INFO ] Dead Transitions using invariants and state equation in 2615 ms found 0 transitions.
[2023-03-12 08:53:37] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:37] [INFO ] Invariant cache hit.
[2023-03-12 08:53:38] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-12 08:53:38] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:38] [INFO ] Invariant cache hit.
[2023-03-12 08:53:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:53:42] [INFO ] Implicit Places using invariants and state equation in 3404 ms returned []
Implicit Place search using SMT with State Equation took 4400 ms to find 0 implicit places.
[2023-03-12 08:53:42] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:42] [INFO ] Invariant cache hit.
[2023-03-12 08:53:44] [INFO ] Dead Transitions using invariants and state equation in 2507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9591 ms. Remains : 226/226 places, 8588/8588 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.62 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 20 factoid took 1376 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Finished random walk after 1361 steps, including 2 resets, run visited all 11 properties in 36 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2))), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1371 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 17202 reset in 2200 ms.
Product exploration explored 100000 steps with 17041 reset in 2213 ms.
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 38 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:53:52] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:52] [INFO ] Invariant cache hit.
[2023-03-12 08:53:55] [INFO ] Dead Transitions using invariants and state equation in 2290 ms found 0 transitions.
[2023-03-12 08:53:55] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:55] [INFO ] Invariant cache hit.
[2023-03-12 08:53:56] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-12 08:53:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:53:56] [INFO ] Invariant cache hit.
[2023-03-12 08:53:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:54:01] [INFO ] Implicit Places using invariants and state equation in 5564 ms returned []
Implicit Place search using SMT with State Equation took 6639 ms to find 0 implicit places.
[2023-03-12 08:54:01] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:54:01] [INFO ] Invariant cache hit.
[2023-03-12 08:54:04] [INFO ] Dead Transitions using invariants and state equation in 2575 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11548 ms. Remains : 226/226 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02 finished in 45005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G(((p0 U p1)&&X(p1))) U (F(p2)||p0)))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Graph (complete) has 11110 edges and 228 vertex of which 227 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.43 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 29 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 226 transition count 8587
Applied a total of 3 rules in 3717 ms. Remains 226 /228 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 08:54:09] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 226 cols
[2023-03-12 08:54:09] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 08:54:11] [INFO ] Dead Transitions using invariants and state equation in 2699 ms found 0 transitions.
[2023-03-12 08:54:11] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:11] [INFO ] Invariant cache hit.
[2023-03-12 08:54:12] [INFO ] Implicit Places using invariants in 817 ms returned []
[2023-03-12 08:54:12] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:12] [INFO ] Invariant cache hit.
[2023-03-12 08:54:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:54:16] [INFO ] Implicit Places using invariants and state equation in 3593 ms returned []
Implicit Place search using SMT with State Equation took 4439 ms to find 0 implicit places.
[2023-03-12 08:54:17] [INFO ] Redundant transitions in 1222 ms returned []
[2023-03-12 08:54:17] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:17] [INFO ] Invariant cache hit.
[2023-03-12 08:54:20] [INFO ] Dead Transitions using invariants and state equation in 2584 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 226/228 places, 8587/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14699 ms. Remains : 226/228 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s84), p2:(LEQ 2 s167), p1:(LEQ s82 (ADD s169 s170))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19555 reset in 2137 ms.
Product exploration explored 100000 steps with 19413 reset in 2138 ms.
Computed a total of 169 stabilizing places and 323 stable transitions
Graph (complete) has 11107 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 169 stabilizing places and 323 stable transitions
Detected a total of 169/226 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 4 factoid took 365 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
[2023-03-12 08:54:25] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:25] [INFO ] Invariant cache hit.
[2023-03-12 08:54:27] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-12 08:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:54:29] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2023-03-12 08:54:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:54:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 08:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:54:32] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2023-03-12 08:54:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:54:32] [INFO ] [Nat]Added 102 Read/Feed constraints in 195 ms returned sat
[2023-03-12 08:54:32] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 548 ms.
[2023-03-12 08:54:33] [INFO ] Added : 52 causal constraints over 13 iterations in 1445 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8587/8587 transitions.
Applied a total of 0 rules in 3222 ms. Remains 226 /226 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 08:54:37] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:37] [INFO ] Invariant cache hit.
[2023-03-12 08:54:39] [INFO ] Dead Transitions using invariants and state equation in 2477 ms found 0 transitions.
[2023-03-12 08:54:39] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:39] [INFO ] Invariant cache hit.
[2023-03-12 08:54:40] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-12 08:54:40] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:40] [INFO ] Invariant cache hit.
[2023-03-12 08:54:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:54:43] [INFO ] Implicit Places using invariants and state equation in 2950 ms returned []
Implicit Place search using SMT with State Equation took 3723 ms to find 0 implicit places.
[2023-03-12 08:54:44] [INFO ] Redundant transitions in 1130 ms returned []
[2023-03-12 08:54:44] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:44] [INFO ] Invariant cache hit.
[2023-03-12 08:54:46] [INFO ] Dead Transitions using invariants and state equation in 2271 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12844 ms. Remains : 226/226 places, 8587/8587 transitions.
Computed a total of 169 stabilizing places and 323 stable transitions
Graph (complete) has 11107 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Computed a total of 169 stabilizing places and 323 stable transitions
Detected a total of 169/226 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 4 factoid took 339 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 4 factoid took 335 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
[2023-03-12 08:54:47] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:54:47] [INFO ] Invariant cache hit.
[2023-03-12 08:54:50] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-12 08:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:54:51] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2023-03-12 08:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:54:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 08:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:54:54] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2023-03-12 08:54:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:54:54] [INFO ] [Nat]Added 102 Read/Feed constraints in 193 ms returned sat
[2023-03-12 08:54:54] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 343 ms.
[2023-03-12 08:54:55] [INFO ] Added : 52 causal constraints over 13 iterations in 981 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 19644 reset in 1925 ms.
Product exploration explored 100000 steps with 19473 reset in 1957 ms.
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 8587/8587 transitions.
Applied a total of 0 rules in 3055 ms. Remains 226 /226 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 08:55:02] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:55:02] [INFO ] Invariant cache hit.
[2023-03-12 08:55:05] [INFO ] Dead Transitions using invariants and state equation in 2581 ms found 0 transitions.
[2023-03-12 08:55:05] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:55:05] [INFO ] Invariant cache hit.
[2023-03-12 08:55:06] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-12 08:55:06] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:55:06] [INFO ] Invariant cache hit.
[2023-03-12 08:55:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:55:08] [INFO ] Implicit Places using invariants and state equation in 2960 ms returned []
Implicit Place search using SMT with State Equation took 3750 ms to find 0 implicit places.
[2023-03-12 08:55:09] [INFO ] Redundant transitions in 973 ms returned []
[2023-03-12 08:55:09] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:55:09] [INFO ] Invariant cache hit.
[2023-03-12 08:55:12] [INFO ] Dead Transitions using invariants and state equation in 2632 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13027 ms. Remains : 226/226 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05 finished in 67470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p0))||(p1&&F(p0)))) U X(X(p2))))'
Support contains 6 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8588
Applied a total of 2 rules in 58 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:55:13] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 08:55:13] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:55:15] [INFO ] Dead Transitions using invariants and state equation in 2356 ms found 0 transitions.
[2023-03-12 08:55:15] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:15] [INFO ] Invariant cache hit.
[2023-03-12 08:55:16] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-12 08:55:16] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:16] [INFO ] Invariant cache hit.
[2023-03-12 08:55:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:55:19] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3695 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 37 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6170 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=true, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}, { cond=(NOT p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(GT s166 (ADD s168 s169)), p1:(GT s166 s83), p2:(LEQ 1 (ADD s170 s171))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23344 reset in 1900 ms.
Product exploration explored 100000 steps with 23495 reset in 2148 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 506 ms. Reduced automaton from 11 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT p2)), (F (AND (NOT p2) p1 (NOT p0))), (F p0), (F p1), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 3 factoid took 626 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Applied a total of 0 rules in 37 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:55:25] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 08:55:25] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 08:55:28] [INFO ] Dead Transitions using invariants and state equation in 2423 ms found 0 transitions.
[2023-03-12 08:55:28] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:28] [INFO ] Invariant cache hit.
[2023-03-12 08:55:29] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-12 08:55:29] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:29] [INFO ] Invariant cache hit.
[2023-03-12 08:55:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:55:31] [INFO ] Implicit Places using invariants and state equation in 2797 ms returned []
Implicit Place search using SMT with State Equation took 3549 ms to find 0 implicit places.
[2023-03-12 08:55:31] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:31] [INFO ] Invariant cache hit.
[2023-03-12 08:55:34] [INFO ] Dead Transitions using invariants and state equation in 2619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8646 ms. Remains : 225/225 places, 8588/8588 transitions.
Computed a total of 168 stabilizing places and 324 stable transitions
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 428 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Finished random walk after 686 steps, including 0 resets, run visited all 6 properties in 15 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 456 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21473 reset in 1979 ms.
Product exploration explored 100000 steps with 21674 reset in 1976 ms.
Applying partial POR strategy [false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 16 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 8588
Deduced a syphon composed of 1 places in 15 ms
Applied a total of 1 rules in 3276 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:55:44] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 08:55:44] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 08:55:46] [INFO ] Dead Transitions using invariants and state equation in 2462 ms found 0 transitions.
[2023-03-12 08:55:47] [INFO ] Redundant transitions in 869 ms returned []
[2023-03-12 08:55:47] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:47] [INFO ] Invariant cache hit.
[2023-03-12 08:55:50] [INFO ] Dead Transitions using invariants and state equation in 2600 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 225/225 places, 8588/8588 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9242 ms. Remains : 225/225 places, 8588/8588 transitions.
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 8588/8588 transitions.
Applied a total of 0 rules in 39 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:55:50] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 08:55:50] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 08:55:52] [INFO ] Dead Transitions using invariants and state equation in 2466 ms found 0 transitions.
[2023-03-12 08:55:52] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:52] [INFO ] Invariant cache hit.
[2023-03-12 08:55:53] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-12 08:55:53] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:53] [INFO ] Invariant cache hit.
[2023-03-12 08:55:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:55:56] [INFO ] Implicit Places using invariants and state equation in 2426 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2023-03-12 08:55:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:55:56] [INFO ] Invariant cache hit.
[2023-03-12 08:55:58] [INFO ] Dead Transitions using invariants and state equation in 2604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8315 ms. Remains : 225/225 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06 finished in 46104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Graph (complete) has 11110 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 223 transition count 8586
Applied a total of 6 rules in 3691 ms. Remains 223 /228 variables (removed 5) and now considering 8586/8588 (removed 2) transitions.
[2023-03-12 08:56:02] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2023-03-12 08:56:02] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-12 08:56:03] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-12 08:56:03] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 08:56:03] [INFO ] Invariant cache hit.
[2023-03-12 08:56:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:56:07] [INFO ] Implicit Places using invariants and state equation in 3456 ms returned [82, 164]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4476 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/228 places, 8586/8588 transitions.
Applied a total of 0 rules in 3689 ms. Remains 221 /221 variables (removed 0) and now considering 8586/8586 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11860 ms. Remains : 221/228 places, 8586/8588 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s163 (ADD s219 s220))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 488 steps with 0 reset in 13 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-07 finished in 11968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U X(X(((p1 U p2)&&F(p1)))))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 8588
Applied a total of 1 rules in 60 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:56:11] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 08:56:11] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-12 08:56:13] [INFO ] Dead Transitions using invariants and state equation in 2677 ms found 0 transitions.
[2023-03-12 08:56:13] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:13] [INFO ] Invariant cache hit.
[2023-03-12 08:56:14] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-12 08:56:14] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:14] [INFO ] Invariant cache hit.
[2023-03-12 08:56:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:56:19] [INFO ] Implicit Places using invariants and state equation in 4254 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5264 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 226/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 45 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8061 ms. Remains : 226/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={1, 2} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=true, acceptance={0, 1, 2} source=1 dest: 2}, { cond=p0, acceptance={1, 2} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={1, 2} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=4 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2} source=5 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=6 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) p2), acceptance={1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=7 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 1 s166) (LEQ s83 1)), p1:(LEQ 1 s166), p2:(LEQ s168 s167)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1921 reset in 1460 ms.
Product exploration explored 100000 steps with 2019 reset in 1467 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.32 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 1012 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Finished random walk after 575 steps, including 0 resets, run visited all 9 properties in 29 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 p2 (NOT p1)))), (F (AND p2 p1)), (F (AND p0 p2 p1)), (F (AND p0 (NOT p2) p1)), (F (NOT p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 1286 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Stuttering acceptance computed with spot in 222 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 46 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:56:25] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 08:56:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:56:28] [INFO ] Dead Transitions using invariants and state equation in 2420 ms found 0 transitions.
[2023-03-12 08:56:28] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:28] [INFO ] Invariant cache hit.
[2023-03-12 08:56:29] [INFO ] Implicit Places using invariants in 1029 ms returned []
[2023-03-12 08:56:29] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:29] [INFO ] Invariant cache hit.
[2023-03-12 08:56:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:56:32] [INFO ] Implicit Places using invariants and state equation in 2607 ms returned []
Implicit Place search using SMT with State Equation took 3673 ms to find 0 implicit places.
[2023-03-12 08:56:32] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:32] [INFO ] Invariant cache hit.
[2023-03-12 08:56:34] [INFO ] Dead Transitions using invariants and state equation in 2604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8770 ms. Remains : 226/226 places, 8588/8588 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.38 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 945 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Finished random walk after 574 steps, including 0 resets, run visited all 9 properties in 18 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), true, (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p1 p2)), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 939 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Stuttering acceptance computed with spot in 278 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Stuttering acceptance computed with spot in 273 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, false]
Product exploration explored 100000 steps with 1964 reset in 1523 ms.
Product exploration explored 100000 steps with 2081 reset in 1551 ms.
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 52 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:56:40] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:40] [INFO ] Invariant cache hit.
[2023-03-12 08:56:43] [INFO ] Dead Transitions using invariants and state equation in 2546 ms found 0 transitions.
[2023-03-12 08:56:43] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:43] [INFO ] Invariant cache hit.
[2023-03-12 08:56:44] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-12 08:56:44] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:44] [INFO ] Invariant cache hit.
[2023-03-12 08:56:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:56:46] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 3149 ms to find 0 implicit places.
[2023-03-12 08:56:46] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:46] [INFO ] Invariant cache hit.
[2023-03-12 08:56:49] [INFO ] Dead Transitions using invariants and state equation in 2470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8256 ms. Remains : 226/226 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08 finished in 38428 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&&X(p0)))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8588
Applied a total of 2 rules in 54 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:56:49] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 08:56:49] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 08:56:52] [INFO ] Dead Transitions using invariants and state equation in 2577 ms found 0 transitions.
[2023-03-12 08:56:52] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:52] [INFO ] Invariant cache hit.
[2023-03-12 08:56:53] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-12 08:56:53] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:53] [INFO ] Invariant cache hit.
[2023-03-12 08:56:53] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:56:56] [INFO ] Implicit Places using invariants and state equation in 3070 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3976 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 43 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6664 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 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:(LEQ s166 s83)], 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 1211 steps with 1 reset in 24 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-11 finished in 6812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 8588
Applied a total of 1 rules in 81 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:56:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 08:56:56] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 08:56:58] [INFO ] Dead Transitions using invariants and state equation in 2465 ms found 0 transitions.
[2023-03-12 08:56:58] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:58] [INFO ] Invariant cache hit.
[2023-03-12 08:56:59] [INFO ] Implicit Places using invariants in 919 ms returned []
[2023-03-12 08:56:59] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:56:59] [INFO ] Invariant cache hit.
[2023-03-12 08:57:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:57:03] [INFO ] Implicit Places using invariants and state equation in 3615 ms returned [84, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4561 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 43 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7175 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ 3 s82), p0:(LEQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2120 ms.
Product exploration explored 100000 steps with 50000 reset in 2410 ms.
Computed a total of 168 stabilizing places and 324 stable transitions
Graph (complete) has 10781 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.40 ms
Computed a total of 168 stabilizing places and 324 stable transitions
Detected a total of 168/225 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-12 finished in 12030 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||(X(p1)&&G(p2))))))'
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8588
Applied a total of 2 rules in 54 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:57:08] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 08:57:08] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:57:10] [INFO ] Dead Transitions using invariants and state equation in 2515 ms found 0 transitions.
[2023-03-12 08:57:10] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:10] [INFO ] Invariant cache hit.
[2023-03-12 08:57:11] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-12 08:57:11] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:11] [INFO ] Invariant cache hit.
[2023-03-12 08:57:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:57:15] [INFO ] Implicit Places using invariants and state equation in 4108 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5041 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 225/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 42 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7676 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s0), p2:(GT (ADD s223 s224) s165), p1:(GT 3 s166)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 653 steps with 1 reset in 13 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-14 finished in 7909 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 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 8588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 225 transition count 8587
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 225 transition count 8587
Applied a total of 4 rules in 115 ms. Remains 225 /228 variables (removed 3) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 08:57:16] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 08:57:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 08:57:18] [INFO ] Dead Transitions using invariants and state equation in 2493 ms found 0 transitions.
[2023-03-12 08:57:18] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:57:18] [INFO ] Invariant cache hit.
[2023-03-12 08:57:19] [INFO ] Implicit Places using invariants in 897 ms returned []
[2023-03-12 08:57:19] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 08:57:19] [INFO ] Invariant cache hit.
[2023-03-12 08:57:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:57:23] [INFO ] Implicit Places using invariants and state equation in 3695 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4643 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 223/228 places, 8587/8588 transitions.
Applied a total of 0 rules in 52 ms. Remains 223 /223 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7308 ms. Remains : 223/228 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 648 steps with 0 reset in 12 ms.
FORMULA BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-15 finished in 7411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(p1)))||G(p2)))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Graph (complete) has 11110 edges and 228 vertex of which 227 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 87 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:57:23] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 08:57:23] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 08:57:26] [INFO ] Dead Transitions using invariants and state equation in 2612 ms found 0 transitions.
[2023-03-12 08:57:26] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:26] [INFO ] Invariant cache hit.
[2023-03-12 08:57:27] [INFO ] Implicit Places using invariants in 935 ms returned []
[2023-03-12 08:57:27] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:27] [INFO ] Invariant cache hit.
[2023-03-12 08:57:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:57:30] [INFO ] Implicit Places using invariants and state equation in 3074 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4030 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 226/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 72 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6816 ms. Remains : 226/228 places, 8588/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT s166 s168), p1:(GT 1 s83), p2:(GT s82 s165)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17074 reset in 2146 ms.
Product exploration explored 100000 steps with 17068 reset in 2030 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.33 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 20 factoid took 1252 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Finished random walk after 680 steps, including 1 resets, run visited all 11 properties in 35 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2))), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1329 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 57 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:57:38] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 08:57:38] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 08:57:40] [INFO ] Dead Transitions using invariants and state equation in 2646 ms found 0 transitions.
[2023-03-12 08:57:40] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:40] [INFO ] Invariant cache hit.
[2023-03-12 08:57:41] [INFO ] Implicit Places using invariants in 873 ms returned []
[2023-03-12 08:57:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:41] [INFO ] Invariant cache hit.
[2023-03-12 08:57:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:57:44] [INFO ] Implicit Places using invariants and state equation in 2432 ms returned []
Implicit Place search using SMT with State Equation took 3329 ms to find 0 implicit places.
[2023-03-12 08:57:44] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:44] [INFO ] Invariant cache hit.
[2023-03-12 08:57:46] [INFO ] Dead Transitions using invariants and state equation in 2595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8662 ms. Remains : 226/226 places, 8588/8588 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Graph (complete) has 10945 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.33 ms
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/226 stabilizing places and 324/8588 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 20 factoid took 1144 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Finished random walk after 680 steps, including 1 resets, run visited all 11 properties in 30 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2))), (F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 20 factoid took 1367 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 17142 reset in 1973 ms.
Product exploration explored 100000 steps with 17254 reset in 1951 ms.
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 8588/8588 transitions.
Applied a total of 0 rules in 68 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 08:57:53] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:53] [INFO ] Invariant cache hit.
[2023-03-12 08:57:56] [INFO ] Dead Transitions using invariants and state equation in 2536 ms found 0 transitions.
[2023-03-12 08:57:56] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:56] [INFO ] Invariant cache hit.
[2023-03-12 08:57:57] [INFO ] Implicit Places using invariants in 945 ms returned []
[2023-03-12 08:57:57] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:57:57] [INFO ] Invariant cache hit.
[2023-03-12 08:57:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 08:58:01] [INFO ] Implicit Places using invariants and state equation in 4567 ms returned []
Implicit Place search using SMT with State Equation took 5549 ms to find 0 implicit places.
[2023-03-12 08:58:02] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 08:58:02] [INFO ] Invariant cache hit.
[2023-03-12 08:58:04] [INFO ] Dead Transitions using invariants and state equation in 2306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10473 ms. Remains : 226/226 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02 finished in 41009 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G(((p0 U p1)&&X(p1))) U (F(p2)||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(F(p0))||(p1&&F(p0)))) U X(X(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' '!(F(!(p0 U X(X(((p1 U p2)&&F(p1)))))))'
[2023-03-12 08:58:05] [INFO ] Flatten gal took : 229 ms
[2023-03-12 08:58:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 08:58:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 8588 transitions and 67470 arcs took 68 ms.
Total runtime 314082 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3152/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3152/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3152/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3152/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06
Could not compute solution for formula : BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08

BK_STOP 1678611493779

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-COL-V80P50N50-LTLCardinality-02
ltl formula formula --ltl=/tmp/3152/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 228 places, 8588 transitions and 67470 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 1.230 real 0.280 user 0.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3152/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3152/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3152/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3152/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-COL-V80P50N50-LTLCardinality-05
ltl formula formula --ltl=/tmp/3152/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 228 places, 8588 transitions and 67470 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 1.330 real 0.240 user 0.190 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3152/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3152/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3152/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3152/ltl_1_
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)
ltl formula name BridgeAndVehicles-COL-V80P50N50-LTLCardinality-06
ltl formula formula --ltl=/tmp/3152/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 228 places, 8588 transitions and 67470 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 1.380 real 0.240 user 0.200 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3152/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3152/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3152/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3152/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-COL-V80P50N50-LTLCardinality-08
ltl formula formula --ltl=/tmp/3152/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 228 places, 8588 transitions and 67470 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 1.270 real 0.320 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3152/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3152/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3152/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3152/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 13 states
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="BridgeAndVehicles-COL-V80P50N50"
export BK_EXAMINATION="LTLCardinality"
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 BridgeAndVehicles-COL-V80P50N50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694300155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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