About the Execution of LTSMin+red for BridgeAndVehicles-PT-V10P10N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 615.275 | 71235.00 | 114226.00 | 198.90 | TTT?F?F?FFFT???? | normal |
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-167813694300171.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-V10P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694300171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 12K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 49K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 25 12:03 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 5.1K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 25 12:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Feb 25 12:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K Feb 25 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 526K Feb 25 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:35 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 223K 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-V10P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678612230835
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-V10P10N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:10:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 09:10:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:10:32] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-12 09:10:32] [INFO ] Transformed 48 places.
[2023-03-12 09:10:32] [INFO ] Transformed 288 transitions.
[2023-03-12 09:10:32] [INFO ] Parsed PT model containing 48 places and 288 transitions and 2090 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 13 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2023-03-12 09:10:33] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-12 09:10:33] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
[2023-03-12 09:10:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:33] [INFO ] Invariant cache hit.
[2023-03-12 09:10:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 09:10:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:33] [INFO ] Invariant cache hit.
[2023-03-12 09:10:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:33] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-12 09:10:33] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:33] [INFO ] Invariant cache hit.
[2023-03-12 09:10:33] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 48/48 places, 288/288 transitions.
Support contains 20 out of 48 places after structural reductions.
[2023-03-12 09:10:33] [INFO ] Flatten gal took : 126 ms
[2023-03-12 09:10:34] [INFO ] Flatten gal took : 30 ms
[2023-03-12 09:10:34] [INFO ] Input system was already deterministic with 288 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 24) seen :18
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 09:10:34] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:34] [INFO ] Invariant cache hit.
[2023-03-12 09:10:34] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-12 09:10:34] [INFO ] After 60ms SMT Verify possible using all constraints in real 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 13 simplifications.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 44 stable transitions
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U p1))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 35 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:10:35] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:10:35] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:10:35] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2023-03-12 09:10:35] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:35] [INFO ] Invariant cache hit.
[2023-03-12 09:10:35] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 09:10:35] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:35] [INFO ] Invariant cache hit.
[2023-03-12 09:10:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:36] [INFO ] Implicit Places using invariants and state equation in 464 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 579 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 287/288 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 788 ms. Remains : 43/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s13), p0:(GT 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 513 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Computed a total of 26 stabilizing places and 43 stable transitions
Computed a total of 26 stabilizing places and 43 stable transitions
Detected a total of 26/43 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p0))
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-00 finished in 2295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 9 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2023-03-12 09:10:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:10:37] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
[2023-03-12 09:10:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:37] [INFO ] Invariant cache hit.
[2023-03-12 09:10:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 09:10:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:37] [INFO ] Invariant cache hit.
[2023-03-12 09:10:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:38] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 44/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6327 reset in 216 ms.
Product exploration explored 100000 steps with 6322 reset in 290 ms.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-12 09:10:39] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 44 cols
[2023-03-12 09:10:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:10:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:39] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-12 09:10:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:10:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:39] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-12 09:10:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 64 ms returned sat
[2023-03-12 09:10:39] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 19 ms.
[2023-03-12 09:10:39] [INFO ] Added : 11 causal constraints over 3 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 287
Applied a total of 2 rules in 49 ms. Remains 43 /44 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:10:40] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 43 cols
[2023-03-12 09:10:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:10:40] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
[2023-03-12 09:10:40] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:40] [INFO ] Invariant cache hit.
[2023-03-12 09:10:40] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-12 09:10:40] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:40] [INFO ] Invariant cache hit.
[2023-03-12 09:10:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:40] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-12 09:10:40] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-12 09:10:40] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:40] [INFO ] Invariant cache hit.
[2023-03-12 09:10:40] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/44 places, 287/288 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 740 ms. Remains : 43/44 places, 287/288 transitions.
Computed a total of 26 stabilizing places and 43 stable transitions
Computed a total of 26 stabilizing places and 43 stable transitions
Detected a total of 26/43 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2023-03-12 09:10:41] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:41] [INFO ] Invariant cache hit.
[2023-03-12 09:10:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:41] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-12 09:10:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:10:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:10:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:41] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-12 09:10:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 33 ms returned sat
[2023-03-12 09:10:41] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 14 ms.
[2023-03-12 09:10:41] [INFO ] Added : 13 causal constraints over 5 iterations in 194 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7018 reset in 211 ms.
Product exploration explored 100000 steps with 6894 reset in 206 ms.
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 287/287 transitions.
Applied a total of 0 rules in 27 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:10:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:42] [INFO ] Invariant cache hit.
[2023-03-12 09:10:42] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
[2023-03-12 09:10:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:42] [INFO ] Invariant cache hit.
[2023-03-12 09:10:42] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-12 09:10:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:42] [INFO ] Invariant cache hit.
[2023-03-12 09:10:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:42] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-12 09:10:42] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 09:10:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:42] [INFO ] Invariant cache hit.
[2023-03-12 09:10:43] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 800 ms. Remains : 43/43 places, 287/287 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03 finished in 5539 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)||X(!p0)))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2023-03-12 09:10:43] [INFO ] Computed 6 place invariants in 14 ms
[2023-03-12 09:10:43] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
[2023-03-12 09:10:43] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:43] [INFO ] Invariant cache hit.
[2023-03-12 09:10:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-12 09:10:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:44] [INFO ] Invariant cache hit.
[2023-03-12 09:10:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:44] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1041 ms. Remains : 46/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND p0 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 8}]], initial=4, aps=[p0:(GT s14 s28), p1:(GT 2 s14), p2:(LEQ 2 s13)], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04 finished in 1428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&X(F(p1)))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 4 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2023-03-12 09:10:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:10:44] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
[2023-03-12 09:10:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:44] [INFO ] Invariant cache hit.
[2023-03-12 09:10:44] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 09:10:44] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:44] [INFO ] Invariant cache hit.
[2023-03-12 09:10:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:44] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 212 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 44/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT 2 s29), p1:(GT s0 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1176 reset in 309 ms.
Product exploration explored 100000 steps with 1182 reset in 272 ms.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 56 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 442 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:47] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 44 cols
[2023-03-12 09:10:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:10:47] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2023-03-12 09:10:47] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:47] [INFO ] Invariant cache hit.
[2023-03-12 09:10:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-12 09:10:47] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:47] [INFO ] Invariant cache hit.
[2023-03-12 09:10:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:47] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-12 09:10:47] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:47] [INFO ] Invariant cache hit.
[2023-03-12 09:10:47] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 44/44 places, 288/288 transitions.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 32 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1186 reset in 229 ms.
Product exploration explored 100000 steps with 1187 reset in 202 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:49] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:49] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
[2023-03-12 09:10:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 44/44 places, 288/288 transitions.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:50] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 44/44 places, 288/288 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05 finished in 6098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1) U G((X(p2) U !p0))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 4 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:10:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:10:50] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 09:10:50] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:10:50] [INFO ] Invariant cache hit.
[2023-03-12 09:10:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:51] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 200 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 287/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 43/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 215 ms :[p0, (OR (NOT p2) p0), p0, p0, true]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s0), p1:(LEQ s31 1), p2:(LEQ (ADD s27 s28) (ADD s29 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-06 finished in 579 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 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:51] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2023-03-12 09:10:51] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-12 09:10:51] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
[2023-03-12 09:10:51] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:51] [INFO ] Invariant cache hit.
[2023-03-12 09:10:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 09:10:51] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:51] [INFO ] Invariant cache hit.
[2023-03-12 09:10:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:51] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [12, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 201 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/48 places, 288/288 transitions.
Applied a total of 0 rules in 14 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 390 ms. Remains : 45/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07 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:(OR (LEQ s14 s12) (LEQ 1 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5060 reset in 261 ms.
Product exploration explored 100000 steps with 5000 reset in 226 ms.
Computed a total of 28 stabilizing places and 44 stable transitions
Graph (complete) has 621 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 44 stable transitions
Detected a total of 28/45 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
[2023-03-12 09:10:53] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2023-03-12 09:10:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:10:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:56] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-12 09:10:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:10:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-12 09:10:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2023-03-12 09:10:57] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 9 ms to minimize.
[2023-03-12 09:10:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-12 09:10:57] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 21 ms.
[2023-03-12 09:10:57] [INFO ] Added : 8 causal constraints over 4 iterations in 76 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 288/288 transitions.
Applied a total of 0 rules in 19 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:10:57] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:57] [INFO ] Invariant cache hit.
[2023-03-12 09:10:57] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
[2023-03-12 09:10:57] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:57] [INFO ] Invariant cache hit.
[2023-03-12 09:10:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 09:10:57] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:57] [INFO ] Invariant cache hit.
[2023-03-12 09:10:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:57] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-12 09:10:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 09:10:57] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:57] [INFO ] Invariant cache hit.
[2023-03-12 09:10:58] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 741 ms. Remains : 45/45 places, 288/288 transitions.
Computed a total of 28 stabilizing places and 44 stable transitions
Graph (complete) has 621 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 44 stable transitions
Detected a total of 28/45 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0)]
[2023-03-12 09:10:58] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:10:58] [INFO ] Invariant cache hit.
[2023-03-12 09:10:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-12 09:10:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:10:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:10:59] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-12 09:10:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 21 ms returned sat
[2023-03-12 09:10:59] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-12 09:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-12 09:10:59] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 57 transitions) in 19 ms.
[2023-03-12 09:10:59] [INFO ] Added : 10 causal constraints over 2 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5024 reset in 194 ms.
Product exploration explored 100000 steps with 5066 reset in 271 ms.
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 288/288 transitions.
Applied a total of 0 rules in 11 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:00] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:00] [INFO ] Invariant cache hit.
[2023-03-12 09:11:00] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
[2023-03-12 09:11:00] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:00] [INFO ] Invariant cache hit.
[2023-03-12 09:11:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 09:11:00] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:00] [INFO ] Invariant cache hit.
[2023-03-12 09:11:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:00] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-12 09:11:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:00] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:00] [INFO ] Invariant cache hit.
[2023-03-12 09:11:00] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 45/45 places, 288/288 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07 finished in 9652 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((!p0&&X((!p0 U (p1||G(!p0))))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 1 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:00] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2023-03-12 09:11:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:11:01] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-12 09:11:01] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:01] [INFO ] Invariant cache hit.
[2023-03-12 09:11:01] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 09:11:01] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:01] [INFO ] Invariant cache hit.
[2023-03-12 09:11:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:01] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 239 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 387 ms. Remains : 45/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, p0, (AND p0 (NOT p1)), p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 1 s14), p1:(GT s13 s12)], 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 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08 finished in 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 288
Applied a total of 1 rules in 2 ms. Remains 47 /48 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:01] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 47 cols
[2023-03-12 09:11:01] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 09:11:01] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
[2023-03-12 09:11:01] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:01] [INFO ] Invariant cache hit.
[2023-03-12 09:11:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-12 09:11:01] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:01] [INFO ] Invariant cache hit.
[2023-03-12 09:11:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:01] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 256 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 288/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 410 ms. Remains : 45/48 places, 288/288 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09 finished in 571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 287
Applied a total of 3 rules in 17 ms. Remains 46 /48 variables (removed 2) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:11:02] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 46 cols
[2023-03-12 09:11:02] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 09:11:02] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
[2023-03-12 09:11:02] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:02] [INFO ] Invariant cache hit.
[2023-03-12 09:11:02] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-12 09:11:02] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:02] [INFO ] Invariant cache hit.
[2023-03-12 09:11:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [12, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 295 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/48 places, 287/288 transitions.
Applied a total of 0 rules in 10 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 559 ms. Remains : 44/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s32 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3848 reset in 190 ms.
Product exploration explored 100000 steps with 3845 reset in 214 ms.
Computed a total of 27 stabilizing places and 43 stable transitions
Graph (complete) has 619 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 43 stable transitions
Detected a total of 27/44 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-12 09:11:03] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2023-03-12 09:11:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:11:03] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:11:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:03] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-12 09:11:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-12 09:11:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2023-03-12 09:11:04] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2023-03-12 09:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-12 09:11:04] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 17 ms.
[2023-03-12 09:11:04] [INFO ] Added : 10 causal constraints over 2 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:04] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:04] [INFO ] Invariant cache hit.
[2023-03-12 09:11:04] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2023-03-12 09:11:04] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:04] [INFO ] Invariant cache hit.
[2023-03-12 09:11:04] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 09:11:04] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:04] [INFO ] Invariant cache hit.
[2023-03-12 09:11:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-12 09:11:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:04] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:04] [INFO ] Invariant cache hit.
[2023-03-12 09:11:04] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 44/44 places, 287/287 transitions.
Computed a total of 27 stabilizing places and 43 stable transitions
Graph (complete) has 619 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 43 stable transitions
Detected a total of 27/44 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
[2023-03-12 09:11:05] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:05] [INFO ] Invariant cache hit.
[2023-03-12 09:11:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 09:11:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:05] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-12 09:11:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2023-03-12 09:11:05] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 16 ms.
[2023-03-12 09:11:05] [INFO ] Added : 11 causal constraints over 3 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3849 reset in 206 ms.
Product exploration explored 100000 steps with 3855 reset in 212 ms.
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 13 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:06] [INFO ] Invariant cache hit.
[2023-03-12 09:11:06] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
[2023-03-12 09:11:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:06] [INFO ] Invariant cache hit.
[2023-03-12 09:11:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-12 09:11:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:06] [INFO ] Invariant cache hit.
[2023-03-12 09:11:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:06] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-12 09:11:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:06] [INFO ] Invariant cache hit.
[2023-03-12 09:11:06] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 595 ms. Remains : 44/44 places, 287/287 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12 finished in 4671 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(F(p1))))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:11:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:11:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:11:06] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2023-03-12 09:11:06] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:06] [INFO ] Invariant cache hit.
[2023-03-12 09:11:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-12 09:11:07] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:07] [INFO ] Invariant cache hit.
[2023-03-12 09:11:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:07] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-12 09:11:07] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:07] [INFO ] Invariant cache hit.
[2023-03-12 09:11:07] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 287/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 45/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s31 s28), p0:(LEQ s28 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1444 reset in 195 ms.
Product exploration explored 100000 steps with 1449 reset in 250 ms.
Computed a total of 28 stabilizing places and 43 stable transitions
Computed a total of 28 stabilizing places and 43 stable transitions
Detected a total of 28/45 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 345 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
[2023-03-12 09:11:09] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:09] [INFO ] Invariant cache hit.
[2023-03-12 09:11:09] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-12 09:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-12 09:11:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2023-03-12 09:11:09] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 12 ms.
[2023-03-12 09:11:09] [INFO ] Added : 11 causal constraints over 4 iterations in 43 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 287/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:09] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:09] [INFO ] Invariant cache hit.
[2023-03-12 09:11:09] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
[2023-03-12 09:11:09] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:09] [INFO ] Invariant cache hit.
[2023-03-12 09:11:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 09:11:09] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:09] [INFO ] Invariant cache hit.
[2023-03-12 09:11:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:10] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-12 09:11:10] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:10] [INFO ] Invariant cache hit.
[2023-03-12 09:11:10] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 45/45 places, 287/287 transitions.
Computed a total of 28 stabilizing places and 43 stable transitions
Computed a total of 28 stabilizing places and 43 stable transitions
Detected a total of 28/45 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 346 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 84 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
[2023-03-12 09:11:11] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:11] [INFO ] Invariant cache hit.
[2023-03-12 09:11:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-12 09:11:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:11] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-12 09:11:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 9 ms returned sat
[2023-03-12 09:11:11] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 11 ms.
[2023-03-12 09:11:11] [INFO ] Added : 11 causal constraints over 4 iterations in 57 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1464 reset in 207 ms.
Product exploration explored 100000 steps with 1465 reset in 215 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 287/287 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 287
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 10 ms. Remains 45 /45 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:11:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:11:12] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
[2023-03-12 09:11:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:12] [INFO ] Invariant cache hit.
[2023-03-12 09:11:12] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/45 places, 287/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 45/45 places, 287/287 transitions.
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 287/287 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:11:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:11:13] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
[2023-03-12 09:11:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:13] [INFO ] Invariant cache hit.
[2023-03-12 09:11:13] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 09:11:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:13] [INFO ] Invariant cache hit.
[2023-03-12 09:11:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:13] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-12 09:11:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:13] [INFO ] Invariant cache hit.
[2023-03-12 09:11:13] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 45/45 places, 287/287 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 finished in 6727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p0 U p1))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 287
Applied a total of 3 rules in 26 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:11:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:11:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:11:13] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
[2023-03-12 09:11:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:13] [INFO ] Invariant cache hit.
[2023-03-12 09:11:13] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 09:11:13] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:13] [INFO ] Invariant cache hit.
[2023-03-12 09:11:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:13] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 235 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/48 places, 287/288 transitions.
Applied a total of 0 rules in 11 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 44/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s26 s14), p1:(LEQ s29 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1562 reset in 205 ms.
Product exploration explored 100000 steps with 1564 reset in 208 ms.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:15] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2023-03-12 09:11:15] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:11:15] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
[2023-03-12 09:11:15] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:15] [INFO ] Invariant cache hit.
[2023-03-12 09:11:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-12 09:11:15] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:15] [INFO ] Invariant cache hit.
[2023-03-12 09:11:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:15] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-12 09:11:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:15] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:15] [INFO ] Invariant cache hit.
[2023-03-12 09:11:15] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 44/44 places, 287/287 transitions.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1569 reset in 252 ms.
Product exploration explored 100000 steps with 1560 reset in 215 ms.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:17] [INFO ] Invariant cache hit.
[2023-03-12 09:11:17] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:17] [INFO ] Invariant cache hit.
[2023-03-12 09:11:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:17] [INFO ] Invariant cache hit.
[2023-03-12 09:11:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:17] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 09:11:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:17] [INFO ] Invariant cache hit.
[2023-03-12 09:11:17] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 ms. Remains : 44/44 places, 287/287 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14 finished in 4151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 287
Applied a total of 4 rules in 4 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:11:17] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:11:17] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:17] [INFO ] Invariant cache hit.
[2023-03-12 09:11:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-12 09:11:17] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:17] [INFO ] Invariant cache hit.
[2023-03-12 09:11:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:18] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 335 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 287/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 515 ms. Remains : 43/48 places, 287/288 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 1 s7), p0:(LEQ s22 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1153 reset in 187 ms.
Product exploration explored 100000 steps with 1154 reset in 216 ms.
Computed a total of 26 stabilizing places and 43 stable transitions
Computed a total of 26 stabilizing places and 43 stable transitions
Detected a total of 26/43 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 324 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 287/287 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 41 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 40 transition count 285
Applied a total of 5 rules in 12 ms. Remains 40 /43 variables (removed 3) and now considering 285/287 (removed 2) transitions.
[2023-03-12 09:11:19] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 40 cols
[2023-03-12 09:11:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:11:19] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-12 09:11:19] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:19] [INFO ] Invariant cache hit.
[2023-03-12 09:11:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:19] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-12 09:11:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:19] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:19] [INFO ] Invariant cache hit.
[2023-03-12 09:11:20] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/43 places, 285/287 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 574 ms. Remains : 40/43 places, 285/287 transitions.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1525 reset in 211 ms.
Product exploration explored 100000 steps with 1526 reset in 190 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 285/285 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-12 09:11:20] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:20] [INFO ] Invariant cache hit.
[2023-03-12 09:11:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 09:11:20] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:20] [INFO ] Invariant cache hit.
[2023-03-12 09:11:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:21] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-12 09:11:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:21] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:21] [INFO ] Invariant cache hit.
[2023-03-12 09:11:21] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 40/40 places, 285/285 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15 finished in 3569 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)))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 287
Applied a total of 3 rules in 21 ms. Remains 45 /48 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2023-03-12 09:11:21] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2023-03-12 09:11:21] [INFO ] Computed 5 place invariants in 18 ms
[2023-03-12 09:11:21] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2023-03-12 09:11:21] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:21] [INFO ] Invariant cache hit.
[2023-03-12 09:11:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-12 09:11:21] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:21] [INFO ] Invariant cache hit.
[2023-03-12 09:11:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:21] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 230 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 43/48 places, 287/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 421 ms. Remains : 43/48 places, 287/288 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 6909 reset in 176 ms.
Product exploration explored 100000 steps with 6892 reset in 201 ms.
Computed a total of 26 stabilizing places and 43 stable transitions
Computed a total of 26 stabilizing places and 43 stable transitions
Detected a total of 26/43 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-12 09:11:22] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 43 cols
[2023-03-12 09:11:22] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:22] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-12 09:11:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-12 09:11:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:22] [INFO ] [Nat]Added 22 Read/Feed constraints in 51 ms returned sat
[2023-03-12 09:11:22] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 14 ms.
[2023-03-12 09:11:23] [INFO ] Added : 8 causal constraints over 3 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 287/287 transitions.
Applied a total of 0 rules in 9 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:23] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:23] [INFO ] Invariant cache hit.
[2023-03-12 09:11:23] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
[2023-03-12 09:11:23] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:23] [INFO ] Invariant cache hit.
[2023-03-12 09:11:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-12 09:11:23] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:23] [INFO ] Invariant cache hit.
[2023-03-12 09:11:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:23] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-12 09:11:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:23] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:23] [INFO ] Invariant cache hit.
[2023-03-12 09:11:23] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 600 ms. Remains : 43/43 places, 287/287 transitions.
Computed a total of 26 stabilizing places and 43 stable transitions
Computed a total of 26 stabilizing places and 43 stable transitions
Detected a total of 26/43 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-12 09:11:24] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:24] [INFO ] Invariant cache hit.
[2023-03-12 09:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-12 09:11:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-12 09:11:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2023-03-12 09:11:24] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 11 ms.
[2023-03-12 09:11:24] [INFO ] Added : 13 causal constraints over 5 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7082 reset in 175 ms.
Product exploration explored 100000 steps with 6901 reset in 189 ms.
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 287/287 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2023-03-12 09:11:24] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:24] [INFO ] Invariant cache hit.
[2023-03-12 09:11:24] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
[2023-03-12 09:11:24] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:24] [INFO ] Invariant cache hit.
[2023-03-12 09:11:25] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-12 09:11:25] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:25] [INFO ] Invariant cache hit.
[2023-03-12 09:11:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:25] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-12 09:11:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:25] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
[2023-03-12 09:11:25] [INFO ] Invariant cache hit.
[2023-03-12 09:11:25] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 43/43 places, 287/287 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03 finished in 4140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&X(F(p1)))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:25] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2023-03-12 09:11:25] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:11:25] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2023-03-12 09:11:25] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:25] [INFO ] Invariant cache hit.
[2023-03-12 09:11:25] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-12 09:11:25] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:25] [INFO ] Invariant cache hit.
[2023-03-12 09:11:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:26] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 299 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 44/48 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 481 ms. Remains : 44/48 places, 288/288 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GT 2 s29), p1:(GT s0 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1186 reset in 230 ms.
Product exploration explored 100000 steps with 1177 reset in 199 ms.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 386 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 64 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 420 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:27] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 44 cols
[2023-03-12 09:11:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-12 09:11:27] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
[2023-03-12 09:11:27] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:27] [INFO ] Invariant cache hit.
[2023-03-12 09:11:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 09:11:27] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:27] [INFO ] Invariant cache hit.
[2023-03-12 09:11:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-12 09:11:28] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:28] [INFO ] Invariant cache hit.
[2023-03-12 09:11:28] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 44/44 places, 288/288 transitions.
Computed a total of 27 stabilizing places and 44 stable transitions
Computed a total of 27 stabilizing places and 44 stable transitions
Detected a total of 27/44 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1178 reset in 263 ms.
Product exploration explored 100000 steps with 1182 reset in 236 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:29] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:29] [INFO ] Invariant cache hit.
[2023-03-12 09:11:29] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
[2023-03-12 09:11:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:30] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:30] [INFO ] Invariant cache hit.
[2023-03-12 09:11:30] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 44/44 places, 288/288 transitions.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 288/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-12 09:11:30] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:30] [INFO ] Invariant cache hit.
[2023-03-12 09:11:30] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
[2023-03-12 09:11:30] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:30] [INFO ] Invariant cache hit.
[2023-03-12 09:11:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 09:11:30] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:30] [INFO ] Invariant cache hit.
[2023-03-12 09:11:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-12 09:11:30] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
[2023-03-12 09:11:30] [INFO ] Invariant cache hit.
[2023-03-12 09:11:30] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 44/44 places, 288/288 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05 finished in 5257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 42 transition count 285
Applied a total of 8 rules in 10 ms. Remains 42 /48 variables (removed 6) and now considering 285/288 (removed 3) transitions.
[2023-03-12 09:11:31] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 42 cols
[2023-03-12 09:11:31] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:11:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-12 09:11:31] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:31] [INFO ] Invariant cache hit.
[2023-03-12 09:11:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:31] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-12 09:11:31] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:31] [INFO ] Invariant cache hit.
[2023-03-12 09:11:31] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 42/48 places, 285/288 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 328 ms. Remains : 42/48 places, 285/288 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s29 s26), p0:(LEQ s26 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1893 reset in 198 ms.
Product exploration explored 100000 steps with 1910 reset in 212 ms.
Computed a total of 26 stabilizing places and 42 stable transitions
Computed a total of 26 stabilizing places and 42 stable transitions
Detected a total of 26/42 stabilizing places and 42/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 62 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 367 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
[2023-03-12 09:11:33] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:33] [INFO ] Invariant cache hit.
[2023-03-12 09:11:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:33] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-12 09:11:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-12 09:11:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2023-03-12 09:11:33] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 54 transitions) in 11 ms.
[2023-03-12 09:11:33] [INFO ] Added : 11 causal constraints over 3 iterations in 52 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 285/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-12 09:11:33] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:33] [INFO ] Invariant cache hit.
[2023-03-12 09:11:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-12 09:11:33] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:33] [INFO ] Invariant cache hit.
[2023-03-12 09:11:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:34] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-12 09:11:34] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:34] [INFO ] Invariant cache hit.
[2023-03-12 09:11:34] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 42/42 places, 285/285 transitions.
Computed a total of 26 stabilizing places and 42 stable transitions
Computed a total of 26 stabilizing places and 42 stable transitions
Detected a total of 26/42 stabilizing places and 42/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 62 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
[2023-03-12 09:11:35] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:35] [INFO ] Invariant cache hit.
[2023-03-12 09:11:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-12 09:11:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:11:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:11:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:11:35] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-12 09:11:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 28 ms returned sat
[2023-03-12 09:11:35] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 54 transitions) in 9 ms.
[2023-03-12 09:11:35] [INFO ] Added : 11 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1896 reset in 195 ms.
Product exploration explored 100000 steps with 1905 reset in 206 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 285/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-12 09:11:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 09:11:36] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:36] [INFO ] Invariant cache hit.
[2023-03-12 09:11:36] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 42/42 places, 285/285 transitions.
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 285/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-12 09:11:36] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:36] [INFO ] Invariant cache hit.
[2023-03-12 09:11:36] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 09:11:36] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:36] [INFO ] Invariant cache hit.
[2023-03-12 09:11:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:37] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-12 09:11:37] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:37] [INFO ] Invariant cache hit.
[2023-03-12 09:11:37] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 42/42 places, 285/285 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 finished in 6377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((p0 U p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Graph (complete) has 670 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 45 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 42 transition count 285
Applied a total of 8 rules in 10 ms. Remains 42 /48 variables (removed 6) and now considering 285/288 (removed 3) transitions.
[2023-03-12 09:11:37] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:37] [INFO ] Invariant cache hit.
[2023-03-12 09:11:37] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 09:11:37] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:37] [INFO ] Invariant cache hit.
[2023-03-12 09:11:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:37] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [12, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 240 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 40/48 places, 285/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 253 ms. Remains : 40/48 places, 285/288 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 1 s7), p0:(LEQ s20 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1526 reset in 223 ms.
Product exploration explored 100000 steps with 1526 reset in 250 ms.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Detected a total of 24/40 stabilizing places and 42/285 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 285/285 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-12 09:11:38] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 40 cols
[2023-03-12 09:11:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-12 09:11:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-12 09:11:38] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:38] [INFO ] Invariant cache hit.
[2023-03-12 09:11:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-12 09:11:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:39] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:39] [INFO ] Invariant cache hit.
[2023-03-12 09:11:39] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 40/40 places, 285/285 transitions.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1527 reset in 212 ms.
Product exploration explored 100000 steps with 1526 reset in 253 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 285/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2023-03-12 09:11:40] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:40] [INFO ] Invariant cache hit.
[2023-03-12 09:11:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-12 09:11:40] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:40] [INFO ] Invariant cache hit.
[2023-03-12 09:11:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 09:11:40] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-12 09:11:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 09:11:40] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
[2023-03-12 09:11:40] [INFO ] Invariant cache hit.
[2023-03-12 09:11:40] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 40/40 places, 285/285 transitions.
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15 finished in 3367 ms.
[2023-03-12 09:11:40] [INFO ] Flatten gal took : 21 ms
[2023-03-12 09:11:40] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 09:11:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 288 transitions and 2090 arcs took 4 ms.
Total runtime 68003 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3025/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14
Could not compute solution for formula : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15
BK_STOP 1678612302070
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-V10P10N10-LTLCardinality-03
ltl formula formula --ltl=/tmp/3025/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 48 places, 288 transitions and 2090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 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-V10P10N10-LTLCardinality-05
ltl formula formula --ltl=/tmp/3025/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 288 transitions and 2090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07
ltl formula formula --ltl=/tmp/3025/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 48 places, 288 transitions and 2090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 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:
0: pnml2lts-mc(+0xa23f4) [0x55e5f39663f4]
1: pnml2lts-mc(+0xa2496) [0x55e5f3966496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8ea8255140]
3: pnml2lts-mc(+0x405be5) [0x55e5f3cc9be5]
4: pnml2lts-mc(+0x16b3f9) [0x55e5f3a2f3f9]
5: pnml2lts-mc(+0x164ac4) [0x55e5f3a28ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e5f3b36e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e5f397a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8ea80a84d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8ea80a867a]
10: pnml2lts-mc(+0xa1581) [0x55e5f3965581]
11: pnml2lts-mc(+0xa1910) [0x55e5f3965910]
12: pnml2lts-mc(+0xa32a2) [0x55e5f39672a2]
13: pnml2lts-mc(+0xa50f4) [0x55e5f39690f4]
14: pnml2lts-mc(+0x3f34b3) [0x55e5f3cb74b3]
15: pnml2lts-mc(+0x7c63d) [0x55e5f394063d]
16: pnml2lts-mc(+0x67d86) [0x55e5f392bd86]
17: pnml2lts-mc(+0x60a8a) [0x55e5f3924a8a]
18: pnml2lts-mc(+0x5eb15) [0x55e5f3922b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8ea8090d0a]
20: pnml2lts-mc(+0x6075e) [0x55e5f392475e]
ltl formula name BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12
ltl formula formula --ltl=/tmp/3025/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 288 transitions and 2090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_3_
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-V10P10N10-LTLCardinality-13
ltl formula formula --ltl=/tmp/3025/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 288 transitions and 2090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_4_
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:
0: pnml2lts-mc(+0xa23f4) [0x5606c65ae3f4]
1: pnml2lts-mc(+0xa2496) [0x5606c65ae496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f75f9818140]
3: pnml2lts-mc(+0x405be5) [0x5606c6911be5]
4: pnml2lts-mc(+0x16b3f9) [0x5606c66773f9]
5: pnml2lts-mc(+0x164ac4) [0x5606c6670ac4]
6: pnml2lts-mc(+0x272e0a) [0x5606c677ee0a]
7: pnml2lts-mc(+0xb61f0) [0x5606c65c21f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f75f966b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f75f966b67a]
10: pnml2lts-mc(+0xa1581) [0x5606c65ad581]
11: pnml2lts-mc(+0xa1910) [0x5606c65ad910]
12: pnml2lts-mc(+0xa32a2) [0x5606c65af2a2]
13: pnml2lts-mc(+0xa50f4) [0x5606c65b10f4]
14: pnml2lts-mc(+0xa516b) [0x5606c65b116b]
15: pnml2lts-mc(+0x3f34b3) [0x5606c68ff4b3]
16: pnml2lts-mc(+0x7c63d) [0x5606c658863d]
17: pnml2lts-mc(+0x67d86) [0x5606c6573d86]
18: pnml2lts-mc(+0x60a8a) [0x5606c656ca8a]
19: pnml2lts-mc(+0x5eb15) [0x5606c656ab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f75f9653d0a]
21: pnml2lts-mc(+0x6075e) [0x5606c656c75e]
ltl formula name BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14
ltl formula formula --ltl=/tmp/3025/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 48 places, 288 transitions and 2090 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
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:
0: pnml2lts-mc(+0xa23f4) [0x564878bd33f4]
1: pnml2lts-mc(+0xa2496) [0x564878bd3496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fa1b61a7140]
3: pnml2lts-mc(+0x405be5) [0x564878f36be5]
4: pnml2lts-mc(+0x16b3f9) [0x564878c9c3f9]
5: pnml2lts-mc(+0x164ac4) [0x564878c95ac4]
6: pnml2lts-mc(+0x272e0a) [0x564878da3e0a]
7: pnml2lts-mc(+0xb61f0) [0x564878be71f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fa1b5ffa4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fa1b5ffa67a]
10: pnml2lts-mc(+0xa1581) [0x564878bd2581]
11: pnml2lts-mc(+0xa1910) [0x564878bd2910]
12: pnml2lts-mc(+0xa32a2) [0x564878bd42a2]
13: pnml2lts-mc(+0xa50f4) [0x564878bd60f4]
14: pnml2lts-mc(+0xa516b) [0x564878bd616b]
15: pnml2lts-mc(+0x3f34b3) [0x564878f244b3]
16: pnml2lts-mc(+0x7c63d) [0x564878bad63d]
17: pnml2lts-mc(+0x67d86) [0x564878b98d86]
18: pnml2lts-mc(+0x60a8a) [0x564878b91a8a]
19: pnml2lts-mc(+0x5eb15) [0x564878b8fb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fa1b5fe2d0a]
21: pnml2lts-mc(+0x6075e) [0x564878b9175e]
ltl formula name BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15
ltl formula formula --ltl=/tmp/3025/ltl_6_
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
pnml2lts-mc( 0/ 4): Petri net has 48 places, 288 transitions and 2090 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3025/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3025/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3025/ltl_6_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3025/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
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:
0: pnml2lts-mc(+0xa23f4) [0x5650da48f3f4]
1: pnml2lts-mc(+0xa2496) [0x5650da48f496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2565366140]
3: pnml2lts-mc(+0x405be5) [0x5650da7f2be5]
4: pnml2lts-mc(+0x16b3f9) [0x5650da5583f9]
5: pnml2lts-mc(+0x164ac4) [0x5650da551ac4]
6: pnml2lts-mc(+0x272e0a) [0x5650da65fe0a]
7: pnml2lts-mc(+0xb61f0) [0x5650da4a31f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f25651b94d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f25651b967a]
10: pnml2lts-mc(+0xa1581) [0x5650da48e581]
11: pnml2lts-mc(+0xa1910) [0x5650da48e910]
12: pnml2lts-mc(+0xa32a2) [0x5650da4902a2]
13: pnml2lts-mc(+0xa50f4) [0x5650da4920f4]
14: pnml2lts-mc(+0xa516b) [0x5650da49216b]
15: pnml2lts-mc(+0x3f34b3) [0x5650da7e04b3]
16: pnml2lts-mc(+0x7c63d) [0x5650da46963d]
17: pnml2lts-mc(+0x67d86) [0x5650da454d86]
18: pnml2lts-mc(+0x60a8a) [0x5650da44da8a]
19: pnml2lts-mc(+0x5eb15) [0x5650da44bb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f25651a1d0a]
21: pnml2lts-mc(+0x6075e) [0x5650da44d75e]
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-V10P10N10"
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-V10P10N10, 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-167813694300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V10P10N10.tgz
mv BridgeAndVehicles-PT-V10P10N10 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 '
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 ;