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-167813694500315.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-PT-V80P50N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 23M
-rw-r--r-- 1 mcc users 30K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 592K Feb 25 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 13:15 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 15K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 209K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 591K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 73K Feb 25 15:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 368K Feb 25 15:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5M Feb 25 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.0M Feb 25 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.1M 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-PT-V80P50N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678624779928

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-PT-V80P50N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:39:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 12:39:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:39:42] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2023-03-12 12:39:42] [INFO ] Transformed 228 places.
[2023-03-12 12:39:42] [INFO ] Transformed 8588 transitions.
[2023-03-12 12:39:42] [INFO ] Parsed PT model containing 228 places and 8588 transitions and 67470 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 163 ms. Remains 228 /228 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:39:42] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 228 cols
[2023-03-12 12:39:43] [INFO ] Computed 7 place invariants in 49 ms
[2023-03-12 12:39:46] [INFO ] Dead Transitions using invariants and state equation in 4000 ms found 0 transitions.
[2023-03-12 12:39:46] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:39:46] [INFO ] Invariant cache hit.
[2023-03-12 12:39:48] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2023-03-12 12:39:48] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:39:48] [INFO ] Invariant cache hit.
[2023-03-12 12:39:49] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 2773 ms to find 0 implicit places.
[2023-03-12 12:39:49] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:39:49] [INFO ] Invariant cache hit.
[2023-03-12 12:39:53] [INFO ] Dead Transitions using invariants and state equation in 3589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10572 ms. Remains : 228/228 places, 8588/8588 transitions.
Support contains 20 out of 228 places after structural reductions.
[2023-03-12 12:39:54] [INFO ] Flatten gal took : 814 ms
[2023-03-12 12:39:55] [INFO ] Flatten gal took : 592 ms
[2023-03-12 12:39:56] [INFO ] Input system was already deterministic with 8588 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 1002 ms. (steps per millisecond=9 ) properties (out of 31) seen :25
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 12:39:58] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:39:58] [INFO ] Invariant cache hit.
[2023-03-12 12:39:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 12:39:59] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-12 12:39:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2023-03-12 12:39:59] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.67 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 242 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:40:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 12:40:00] [INFO ] Computed 6 place invariants in 31 ms
[2023-03-12 12:40:03] [INFO ] Dead Transitions using invariants and state equation in 2988 ms found 0 transitions.
[2023-03-12 12:40:03] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:03] [INFO ] Invariant cache hit.
[2023-03-12 12:40:04] [INFO ] Implicit Places using invariants in 1426 ms returned []
[2023-03-12 12:40:04] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:04] [INFO ] Invariant cache hit.
[2023-03-12 12:40:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:40:09] [INFO ] Implicit Places using invariants and state equation in 5022 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6468 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 49 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 9751 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-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 s173) (GT 2 s172)), p1:(GT 2 s172)], 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 3458 ms.
Product exploration explored 100000 steps with 33333 reset in 2829 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.43 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 (NOT p0) (NOT p1))))), (X (X (NOT (AND 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 329 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-PT-V80P50N50-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-01 finished in 16835 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 62 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:40:16] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:16] [INFO ] Invariant cache hit.
[2023-03-12 12:40:19] [INFO ] Dead Transitions using invariants and state equation in 2677 ms found 0 transitions.
[2023-03-12 12:40:19] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:19] [INFO ] Invariant cache hit.
[2023-03-12 12:40:20] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2023-03-12 12:40:20] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:20] [INFO ] Invariant cache hit.
[2023-03-12 12:40:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:40:27] [INFO ] Implicit Places using invariants and state equation in 6895 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7921 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 43 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 10706 ms. Remains : 226/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 237 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-PT-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 s167 s173), p1:(GT 1 s82), p2:(GT s0 s170)], 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 17120 reset in 2866 ms.
Product exploration explored 100000 steps with 17205 reset in 2712 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.40 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 20 factoid took 1689 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 243 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 484 steps, including 0 resets, run visited all 11 properties in 31 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (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 2078 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 238 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 254 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 55 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:40:38] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:40:38] [INFO ] Computed 6 place invariants in 12 ms
[2023-03-12 12:40:41] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
[2023-03-12 12:40:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:41] [INFO ] Invariant cache hit.
[2023-03-12 12:40:42] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-12 12:40:42] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:42] [INFO ] Invariant cache hit.
[2023-03-12 12:40:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:40:46] [INFO ] Implicit Places using invariants and state equation in 3708 ms returned []
Implicit Place search using SMT with State Equation took 4820 ms to find 0 implicit places.
[2023-03-12 12:40:46] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:46] [INFO ] Invariant cache hit.
[2023-03-12 12:40:48] [INFO ] Dead Transitions using invariants and state equation in 2649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10921 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.40 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 20 factoid took 1030 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 156 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 683 steps, including 1 resets, run visited all 11 properties in 28 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (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 2079 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 238 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 225 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 239 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 17094 reset in 2893 ms.
Product exploration explored 100000 steps with 17071 reset in 2519 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 12:40:58] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:40:58] [INFO ] Invariant cache hit.
[2023-03-12 12:41:01] [INFO ] Dead Transitions using invariants and state equation in 2959 ms found 0 transitions.
[2023-03-12 12:41:01] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:41:01] [INFO ] Invariant cache hit.
[2023-03-12 12:41:02] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2023-03-12 12:41:02] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:41:02] [INFO ] Invariant cache hit.
[2023-03-12 12:41:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:41:12] [INFO ] Implicit Places using invariants and state equation in 9541 ms returned []
Implicit Place search using SMT with State Equation took 10722 ms to find 0 implicit places.
[2023-03-12 12:41:12] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:41:12] [INFO ] Invariant cache hit.
[2023-03-12 12:41:17] [INFO ] Dead Transitions using invariants and state equation in 5092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18863 ms. Remains : 226/226 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-02 finished in 61778 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.36 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 3706 ms. Remains 226 /228 variables (removed 2) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:41:22] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 226 cols
[2023-03-12 12:41:22] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-12 12:41:25] [INFO ] Dead Transitions using invariants and state equation in 3066 ms found 0 transitions.
[2023-03-12 12:41:25] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:25] [INFO ] Invariant cache hit.
[2023-03-12 12:41:26] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-12 12:41:26] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:26] [INFO ] Invariant cache hit.
[2023-03-12 12:41:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:41:29] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 3873 ms to find 0 implicit places.
[2023-03-12 12:41:30] [INFO ] Redundant transitions in 1234 ms returned []
[2023-03-12 12:41:30] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:30] [INFO ] Invariant cache hit.
[2023-03-12 12:41:33] [INFO ] Dead Transitions using invariants and state equation in 2808 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 14701 ms. Remains : 226/228 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-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 s82), p2:(LEQ 2 s169), p1:(LEQ s84 (ADD s86 s87))], 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 19461 reset in 2603 ms.
Product exploration explored 100000 steps with 19486 reset in 2569 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.15 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 614 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 92 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
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 760 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 123 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
[2023-03-12 12:41:40] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:40] [INFO ] Invariant cache hit.
[2023-03-12 12:41:43] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-12 12:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 12:41:44] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2023-03-12 12:41:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 12:41:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-12 12:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 12:41:48] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2023-03-12 12:41:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:41:48] [INFO ] [Nat]Added 102 Read/Feed constraints in 346 ms returned sat
[2023-03-12 12:41:49] [INFO ] Computed and/alt/rep : 210/418/210 causal constraints (skipped 316 transitions) in 602 ms.
[2023-03-12 12:41:50] [INFO ] Added : 52 causal constraints over 14 iterations in 1329 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 3522 ms. Remains 226 /226 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:41:53] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:53] [INFO ] Invariant cache hit.
[2023-03-12 12:41:57] [INFO ] Dead Transitions using invariants and state equation in 3474 ms found 0 transitions.
[2023-03-12 12:41:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:57] [INFO ] Invariant cache hit.
[2023-03-12 12:41:57] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-12 12:41:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:41:57] [INFO ] Invariant cache hit.
[2023-03-12 12:41:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:01] [INFO ] Implicit Places using invariants and state equation in 3324 ms returned []
Implicit Place search using SMT with State Equation took 4176 ms to find 0 implicit places.
[2023-03-12 12:42:02] [INFO ] Redundant transitions in 1189 ms returned []
[2023-03-12 12:42:02] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:02] [INFO ] Invariant cache hit.
[2023-03-12 12:42:06] [INFO ] Dead Transitions using invariants and state equation in 3812 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16190 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.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 343 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 55 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
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 375 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 57 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
[2023-03-12 12:42:07] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:07] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 19585 reset in 2686 ms.
Product exploration explored 100000 steps with 19571 reset in 2521 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 3613 ms. Remains 226 /226 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
[2023-03-12 12:42:31] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:31] [INFO ] Invariant cache hit.
[2023-03-12 12:42:34] [INFO ] Dead Transitions using invariants and state equation in 3524 ms found 0 transitions.
[2023-03-12 12:42:34] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:34] [INFO ] Invariant cache hit.
[2023-03-12 12:42:35] [INFO ] Implicit Places using invariants in 1015 ms returned []
[2023-03-12 12:42:35] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:35] [INFO ] Invariant cache hit.
[2023-03-12 12:42:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:38] [INFO ] Implicit Places using invariants and state equation in 2391 ms returned []
Implicit Place search using SMT with State Equation took 3409 ms to find 0 implicit places.
[2023-03-12 12:42:39] [INFO ] Redundant transitions in 877 ms returned []
[2023-03-12 12:42:39] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:42:39] [INFO ] Invariant cache hit.
[2023-03-12 12:42:41] [INFO ] Dead Transitions using invariants and state equation in 2636 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14085 ms. Remains : 226/226 places, 8587/8587 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-05 finished in 83878 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 56 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:42:42] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:42:42] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 12:42:45] [INFO ] Dead Transitions using invariants and state equation in 2740 ms found 0 transitions.
[2023-03-12 12:42:45] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:42:45] [INFO ] Invariant cache hit.
[2023-03-12 12:42:46] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-12 12:42:46] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:42:46] [INFO ] Invariant cache hit.
[2023-03-12 12:42:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:42:50] [INFO ] Implicit Places using invariants and state equation in 3986 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4854 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 54 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 7707 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 567 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-PT-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 s167 (ADD s84 s85)), p1:(GT s167 s82), p2:(LEQ 1 (ADD s168 s169))], 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 23418 reset in 2362 ms.
Product exploration explored 100000 steps with 23365 reset in 2275 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) (NOT p2)))), (X (X (NOT (AND (NOT p0) (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))]
Knowledge based reduction with 3 factoid took 602 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 457 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 577 steps, including 0 resets, run visited all 6 properties in 17 ms. (steps per millisecond=33 )
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) (NOT p2)))), (X (X (NOT (AND (NOT p0) (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)), (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 740 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 361 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 372 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 42 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:42:58] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 12:42:58] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 12:43:00] [INFO ] Dead Transitions using invariants and state equation in 2561 ms found 0 transitions.
[2023-03-12 12:43:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:00] [INFO ] Invariant cache hit.
[2023-03-12 12:43:02] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2023-03-12 12:43:02] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:02] [INFO ] Invariant cache hit.
[2023-03-12 12:43:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:43:05] [INFO ] Implicit Places using invariants and state equation in 3803 ms returned []
Implicit Place search using SMT with State Equation took 5278 ms to find 0 implicit places.
[2023-03-12 12:43:05] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:05] [INFO ] Invariant cache hit.
[2023-03-12 12:43:08] [INFO ] Dead Transitions using invariants and state equation in 2783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10671 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) (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))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 438 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 381 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 674 steps, including 0 resets, run visited all 6 properties in 33 ms. (steps per millisecond=20 )
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) (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))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (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 567 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 454 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 352 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 472 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 21648 reset in 2752 ms.
Product exploration explored 100000 steps with 21683 reset in 2969 ms.
Applying partial POR strategy [false, false, true, true, false, false, false, true, true]
Stuttering acceptance computed with spot in 495 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 23 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 23 ms
Applied a total of 1 rules in 3690 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:43:21] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 12:43:21] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-12 12:43:24] [INFO ] Dead Transitions using invariants and state equation in 2687 ms found 0 transitions.
[2023-03-12 12:43:25] [INFO ] Redundant transitions in 878 ms returned []
[2023-03-12 12:43:25] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:25] [INFO ] Invariant cache hit.
[2023-03-12 12:43:28] [INFO ] Dead Transitions using invariants and state equation in 3663 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 10928 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 46 ms. Remains 225 /225 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:43:29] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 225 cols
[2023-03-12 12:43:29] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:43:32] [INFO ] Dead Transitions using invariants and state equation in 3676 ms found 0 transitions.
[2023-03-12 12:43:32] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:32] [INFO ] Invariant cache hit.
[2023-03-12 12:43:34] [INFO ] Implicit Places using invariants in 1325 ms returned []
[2023-03-12 12:43:34] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:34] [INFO ] Invariant cache hit.
[2023-03-12 12:43:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:43:42] [INFO ] Implicit Places using invariants and state equation in 8365 ms returned []
Implicit Place search using SMT with State Equation took 9707 ms to find 0 implicit places.
[2023-03-12 12:43:42] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:43:42] [INFO ] Invariant cache hit.
[2023-03-12 12:43:45] [INFO ] Dead Transitions using invariants and state equation in 3003 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16452 ms. Remains : 225/225 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-06 finished in 63489 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.10 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 57 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 4585 ms. Remains 223 /228 variables (removed 5) and now considering 8586/8588 (removed 2) transitions.
[2023-03-12 12:43:50] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
// Phase 1: matrix 528 rows 223 cols
[2023-03-12 12:43:50] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 12:43:52] [INFO ] Implicit Places using invariants in 1651 ms returned []
[2023-03-12 12:43:52] [INFO ] Flow matrix only has 528 transitions (discarded 8058 similar events)
[2023-03-12 12:43:52] [INFO ] Invariant cache hit.
[2023-03-12 12:43:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:43:56] [INFO ] Implicit Places using invariants and state equation in 4214 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5879 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 4035 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 14501 ms. Remains : 221/228 places, 8586/8588 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-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 s169 (ADD s167 s168))], 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 491 steps with 0 reset in 12 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-07 finished in 14626 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||G(p1))))||G((p0||X(p2)))))'
Support contains 3 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 65 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:44:00] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 12:44:00] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-12 12:44:03] [INFO ] Dead Transitions using invariants and state equation in 2934 ms found 0 transitions.
[2023-03-12 12:44:03] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:03] [INFO ] Invariant cache hit.
[2023-03-12 12:44:04] [INFO ] Implicit Places using invariants in 966 ms returned []
[2023-03-12 12:44:04] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:04] [INFO ] Invariant cache hit.
[2023-03-12 12:44:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:08] [INFO ] Implicit Places using invariants and state equation in 4275 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5258 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 96 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 8360 ms. Remains : 226/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s173 s167), p2:(LEQ 1 s167), p1:(LEQ 2 s174)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3234 ms.
Product exploration explored 100000 steps with 50000 reset in 2723 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.66 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 p2) p1), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-08 finished in 14901 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&&X(G(!p1))&&F((!p0||X(X(F(p2))))))))'
Support contains 3 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 110 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:44:15] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:44:15] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:44:18] [INFO ] Dead Transitions using invariants and state equation in 2723 ms found 0 transitions.
[2023-03-12 12:44:18] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:18] [INFO ] Invariant cache hit.
[2023-03-12 12:44:19] [INFO ] Implicit Places using invariants in 965 ms returned []
[2023-03-12 12:44:19] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:19] [INFO ] Invariant cache hit.
[2023-03-12 12:44:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:22] [INFO ] Implicit Places using invariants and state equation in 3612 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4589 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 70 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 7495 ms. Remains : 225/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 367 ms :[p1, (OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), (OR (NOT p0) (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LEQ 1 s82), p0:(GT 2 s170), p2:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-09 finished in 7917 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||X(G(p2)))))))'
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 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 102 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:44:23] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:23] [INFO ] Invariant cache hit.
[2023-03-12 12:44:26] [INFO ] Dead Transitions using invariants and state equation in 3536 ms found 0 transitions.
[2023-03-12 12:44:26] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:26] [INFO ] Invariant cache hit.
[2023-03-12 12:44:28] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2023-03-12 12:44:28] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:28] [INFO ] Invariant cache hit.
[2023-03-12 12:44:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:32] [INFO ] Implicit Places using invariants and state equation in 3938 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5221 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 98 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8961 ms. Remains : 224/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 s169), p1:(LEQ s172 s0), p2:(OR (GT s169 s0) (LEQ s69 s0))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5541 steps with 8 reset in 155 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-10 finished in 9431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 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.10 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 21 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
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 221 transition count 8584
Applied a total of 10 rules in 3614 ms. Remains 221 /228 variables (removed 7) and now considering 8584/8588 (removed 4) transitions.
[2023-03-12 12:44:36] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2023-03-12 12:44:36] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 12:44:37] [INFO ] Implicit Places using invariants in 977 ms returned []
[2023-03-12 12:44:37] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
[2023-03-12 12:44:37] [INFO ] Invariant cache hit.
[2023-03-12 12:44:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:42] [INFO ] Implicit Places using invariants and state equation in 5440 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6440 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 220/228 places, 8584/8588 transitions.
Applied a total of 0 rules in 3081 ms. Remains 220 /220 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13137 ms. Remains : 220/228 places, 8584/8588 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s155)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 914 steps with 2 reset in 25 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-11 finished in 13331 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||X(G(p1)))))'
Support contains 3 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 96 ms. Remains 226 /228 variables (removed 2) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:44:46] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:44:46] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 12:44:49] [INFO ] Dead Transitions using invariants and state equation in 2858 ms found 0 transitions.
[2023-03-12 12:44:49] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:49] [INFO ] Invariant cache hit.
[2023-03-12 12:44:50] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2023-03-12 12:44:50] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:44:50] [INFO ] Invariant cache hit.
[2023-03-12 12:44:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:44:54] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5127 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 224/228 places, 8588/8588 transitions.
Applied a total of 0 rules in 54 ms. Remains 224 /224 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8141 ms. Remains : 224/228 places, 8588/8588 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-12 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LEQ 1 s169) (LEQ s223 s167)), p1:(OR (LEQ 1 s169) (LEQ s223 s167))], 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]]
Entered a terminal (fully accepting) state of product in 306 steps with 0 reset in 18 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-12 finished in 8439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U (p2||G(p1)))&&p0))))'
Support contains 6 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.8 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
Applied a total of 3 rules in 2911 ms. Remains 225 /228 variables (removed 3) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:44:57] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2023-03-12 12:44:57] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 12:45:00] [INFO ] Dead Transitions using invariants and state equation in 2664 ms found 0 transitions.
[2023-03-12 12:45:00] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:45:00] [INFO ] Invariant cache hit.
[2023-03-12 12:45:01] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-12 12:45:01] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:45:01] [INFO ] Invariant cache hit.
[2023-03-12 12:45:02] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2671 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/228 places, 8587/8588 transitions.
Applied a total of 0 rules in 2586 ms. Remains 224 /224 variables (removed 0) and now considering 8587/8587 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10836 ms. Remains : 224/228 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(GT s169 s5), p0:(AND (GT 3 s172) (GT s167 s168) (LEQ s168 s83)), p1:(LEQ s168 s83)], 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 648 steps with 0 reset in 19 ms.
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-14 finished in 11002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(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 124 ms. Remains 225 /228 variables (removed 3) and now considering 8587/8588 (removed 1) transitions.
[2023-03-12 12:45:05] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:45:05] [INFO ] Invariant cache hit.
[2023-03-12 12:45:08] [INFO ] Dead Transitions using invariants and state equation in 2756 ms found 0 transitions.
[2023-03-12 12:45:08] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:45:08] [INFO ] Invariant cache hit.
[2023-03-12 12:45:09] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2023-03-12 12:45:09] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
[2023-03-12 12:45:09] [INFO ] Invariant cache hit.
[2023-03-12 12:45:11] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2729 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 95 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 5706 ms. Remains : 223/228 places, 8587/8588 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 2 s171)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3016 ms.
Product exploration explored 100000 steps with 33333 reset in 3094 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Detected a total of 166/223 stabilizing places and 323/8587 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V80P50N50-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-15 finished in 12299 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-PT-V80P50N50-LTLCardinality-02
Stuttering acceptance computed with spot in 166 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.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 109 ms. Remains 227 /228 variables (removed 1) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:45:18] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 227 cols
[2023-03-12 12:45:18] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-12 12:45:21] [INFO ] Dead Transitions using invariants and state equation in 3002 ms found 0 transitions.
[2023-03-12 12:45:21] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:21] [INFO ] Invariant cache hit.
[2023-03-12 12:45:22] [INFO ] Implicit Places using invariants in 1098 ms returned []
[2023-03-12 12:45:22] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:22] [INFO ] Invariant cache hit.
[2023-03-12 12:45:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:45:32] [INFO ] Implicit Places using invariants and state equation in 10229 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11347 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 81 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 14543 ms. Remains : 226/228 places, 8588/8588 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-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 s167 s173), p1:(GT 1 s82), p2:(GT s0 s170)], 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 17110 reset in 2581 ms.
Product exploration explored 100000 steps with 17209 reset in 2356 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 20 factoid took 1508 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 125 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 4079 steps, including 6 resets, run visited all 11 properties in 153 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (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 1808 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 134 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 138 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 63 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:45:41] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 226 cols
[2023-03-12 12:45:41] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-12 12:45:44] [INFO ] Dead Transitions using invariants and state equation in 2767 ms found 0 transitions.
[2023-03-12 12:45:44] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:44] [INFO ] Invariant cache hit.
[2023-03-12 12:45:45] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2023-03-12 12:45:45] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:45] [INFO ] Invariant cache hit.
[2023-03-12 12:45:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:45:48] [INFO ] Implicit Places using invariants and state equation in 2539 ms returned []
Implicit Place search using SMT with State Equation took 3643 ms to find 0 implicit places.
[2023-03-12 12:45:48] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:45:48] [INFO ] Invariant cache hit.
[2023-03-12 12:45:51] [INFO ] Dead Transitions using invariants and state equation in 3501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10020 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.35 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 (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 20 factoid took 1645 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 186 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 2734 steps, including 4 resets, run visited all 11 properties in 109 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT 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 (NOT p0)), (X p0), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (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 2266 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 249 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 250 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 214 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 17100 reset in 2797 ms.
Product exploration explored 100000 steps with 17163 reset in 2641 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 76 ms. Remains 226 /226 variables (removed 0) and now considering 8588/8588 (removed 0) transitions.
[2023-03-12 12:46:02] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:46:02] [INFO ] Invariant cache hit.
[2023-03-12 12:46:06] [INFO ] Dead Transitions using invariants and state equation in 3796 ms found 0 transitions.
[2023-03-12 12:46:06] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:46:06] [INFO ] Invariant cache hit.
[2023-03-12 12:46:07] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2023-03-12 12:46:07] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:46:07] [INFO ] Invariant cache hit.
[2023-03-12 12:46:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 12:46:13] [INFO ] Implicit Places using invariants and state equation in 6556 ms returned []
Implicit Place search using SMT with State Equation took 7676 ms to find 0 implicit places.
[2023-03-12 12:46:13] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
[2023-03-12 12:46:13] [INFO ] Invariant cache hit.
[2023-03-12 12:46:18] [INFO ] Dead Transitions using invariants and state equation in 4309 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15872 ms. Remains : 226/226 places, 8588/8588 transitions.
Treatment of property BridgeAndVehicles-PT-V80P50N50-LTLCardinality-02 finished in 60925 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))))'
[2023-03-12 12:46:19] [INFO ] Flatten gal took : 516 ms
[2023-03-12 12:46:19] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 12:46:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 228 places, 8588 transitions and 67470 arcs took 64 ms.
Total runtime 397762 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2736/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2736/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2736/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-02
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-05
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N50-LTLCardinality-06

BK_STOP 1678625188930

--------------------
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-PT-V80P50N50-LTLCardinality-02
ltl formula formula --ltl=/tmp/2736/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 2.160 real 0.470 user 0.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2736/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2736/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2736/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2736/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
free(): double free detected in tcache 2
ltl formula name BridgeAndVehicles-PT-V80P50N50-LTLCardinality-05
ltl formula formula --ltl=/tmp/2736/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
Warning: program compiled against libxml 210 using older 209
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
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 2.060 real 0.440 user 0.520 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2736/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2736/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2736/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2736/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-PT-V80P50N50-LTLCardinality-06
ltl formula formula --ltl=/tmp/2736/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.940 real 0.430 user 0.490 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2736/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2736/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2736/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2736/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:

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-PT-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-PT-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-167813694500315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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