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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 22K Feb 25 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 247K Feb 25 12:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 950K Feb 25 12:09 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 11K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 335K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 177K Feb 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 714K Feb 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:36 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 1.1M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678617992006

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:46:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:46:33] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-12 10:46:33] [INFO ] Transformed 128 places.
[2023-03-12 10:46:33] [INFO ] Transformed 1328 transitions.
[2023-03-12 10:46:33] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1328
Applied a total of 2 rules in 37 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:46:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 126 cols
[2023-03-12 10:46:34] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-12 10:46:34] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
[2023-03-12 10:46:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:46:34] [INFO ] Invariant cache hit.
[2023-03-12 10:46:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-12 10:46:35] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:46:35] [INFO ] Invariant cache hit.
[2023-03-12 10:46:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:35] [INFO ] Implicit Places using invariants and state equation in 156 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 904 ms. Remains : 125/128 places, 1328/1328 transitions.
Support contains 125 out of 125 places after structural reductions.
[2023-03-12 10:46:35] [INFO ] Flatten gal took : 148 ms
[2023-03-12 10:46:35] [INFO ] Flatten gal took : 126 ms
[2023-03-12 10:46:36] [INFO ] Input system was already deterministic with 1328 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 10:46:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-12 10:46:38] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:46:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:46:38] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-12 10:46:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:46:38] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 10:46:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:38] [INFO ] After 420ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-12 10:46:39] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 317 ms.
[2023-03-12 10:46:39] [INFO ] After 1387ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 12 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 122 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 120 transition count 1324
Applied a total of 9 rules in 276 ms. Remains 120 /125 variables (removed 5) and now considering 1324/1328 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 120/125 places, 1324/1328 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 297073 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{1=1, 3=1}
Probabilistic random walk after 297073 steps, saw 91289 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-12 10:46:43] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 10:46:43] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 10:46:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:46:43] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:46:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:46:44] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:44] [INFO ] After 202ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:44] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-12 10:46:44] [INFO ] After 691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 91 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 120/120 places, 1324/1324 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 329049 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329049 steps, saw 100136 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:46:48] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:46:48] [INFO ] Invariant cache hit.
[2023-03-12 10:46:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:46:48] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:46:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:46:48] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:48] [INFO ] After 162ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:48] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-12 10:46:48] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 83 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 120/120 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 104 ms. Remains 120 /120 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-12 10:46:49] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:46:49] [INFO ] Invariant cache hit.
[2023-03-12 10:46:49] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-12 10:46:49] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:46:49] [INFO ] Invariant cache hit.
[2023-03-12 10:46:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:49] [INFO ] Implicit Places using invariants and state equation in 442 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 635 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 119/120 places, 1324/1324 transitions.
Applied a total of 0 rules in 76 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 816 ms. Remains : 119/120 places, 1324/1324 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 340013 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340013 steps, saw 102821 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:46:53] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
// Phase 1: matrix 246 rows 119 cols
[2023-03-12 10:46:53] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 10:46:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:46:53] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:46:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:46:53] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:53] [INFO ] After 156ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:53] [INFO ] After 405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-12 10:46:54] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1324/1324 transitions.
Applied a total of 0 rules in 69 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 119/119 places, 1324/1324 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 1324/1324 transitions.
Applied a total of 0 rules in 67 ms. Remains 119 /119 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
[2023-03-12 10:46:54] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:46:54] [INFO ] Invariant cache hit.
[2023-03-12 10:46:54] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-12 10:46:54] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:46:54] [INFO ] Invariant cache hit.
[2023-03-12 10:46:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:54] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2023-03-12 10:46:55] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-12 10:46:55] [INFO ] Flow matrix only has 246 transitions (discarded 1078 similar events)
[2023-03-12 10:46:55] [INFO ] Invariant cache hit.
[2023-03-12 10:46:55] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1413 ms. Remains : 119/119 places, 1324/1324 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 119 transition count 246
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1080 place count 119 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1082 place count 117 transition count 244
Applied a total of 1082 rules in 12 ms. Remains 117 /119 variables (removed 2) and now considering 244/1324 (removed 1080) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 244 rows 117 cols
[2023-03-12 10:46:55] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 10:46:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:46:55] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:46:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:46:55] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:46:55] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:46:55] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-12 10:46:55] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 108 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(p1&&X(G(p2)))))))'
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 10 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:46:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:46:56] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:46:56] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
[2023-03-12 10:46:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:46:56] [INFO ] Invariant cache hit.
[2023-03-12 10:46:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-12 10:46:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:46:56] [INFO ] Invariant cache hit.
[2023-03-12 10:46:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:46:56] [INFO ] Implicit Places using invariants and state equation in 234 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 735 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s53 50) (GEQ s109 1)) (AND (GEQ s53 50) (GEQ s110 1))), p0:(AND (OR (LT s33 1) (LT s55 1) (LT s56 1) (LT s115 1)) (OR (LT s36 1) (LT s55 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25031 reset in 1268 ms.
Product exploration explored 100000 steps with 25051 reset in 1011 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 443 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:47:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:47:01] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:47:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:47:03] [INFO ] After 1637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:47:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:47:05] [INFO ] After 1422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:06] [INFO ] After 1610ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:08] [INFO ] After 3031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1345 ms.
[2023-03-12 10:47:09] [INFO ] After 5889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 114 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 119 transition count 1324
Applied a total of 7 rules in 110 ms. Remains 119 /123 variables (removed 4) and now considering 1324/1327 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 119/123 places, 1324/1327 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Finished probabilistic random walk after 694 steps, run visited all 1 properties in 13 ms. (steps per millisecond=53 )
Probabilistic random walk after 694 steps, saw 499 distinct states, run finished after 13 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 471 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 117 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:47:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:11] [INFO ] Invariant cache hit.
[2023-03-12 10:47:11] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
[2023-03-12 10:47:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:11] [INFO ] Invariant cache hit.
[2023-03-12 10:47:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 10:47:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:11] [INFO ] Invariant cache hit.
[2023-03-12 10:47:12] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-12 10:47:12] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:12] [INFO ] Invariant cache hit.
[2023-03-12 10:47:12] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:47:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:13] [INFO ] Invariant cache hit.
[2023-03-12 10:47:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:47:15] [INFO ] After 1528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:47:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:47:17] [INFO ] After 1605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:18] [INFO ] After 1508ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:47:20] [INFO ] After 3080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1571 ms.
[2023-03-12 10:47:21] [INFO ] After 6365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 114 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 121 transition count 1326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 119 transition count 1324
Applied a total of 7 rules in 85 ms. Remains 119 /123 variables (removed 4) and now considering 1324/1327 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 119/123 places, 1324/1327 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Finished probabilistic random walk after 694 steps, run visited all 1 properties in 13 ms. (steps per millisecond=53 )
Probabilistic random walk after 694 steps, saw 499 distinct states, run finished after 13 ms. (steps per millisecond=53 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND p2 (NOT p0))), (F p1), (F (AND (NOT p2) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 486 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Product exploration explored 100000 steps with 24973 reset in 1225 ms.
Product exploration explored 100000 steps with 24932 reset in 923 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 117 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 133 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:47:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:26] [INFO ] Invariant cache hit.
[2023-03-12 10:47:26] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
[2023-03-12 10:47:26] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 10:47:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:26] [INFO ] Invariant cache hit.
[2023-03-12 10:47:27] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1089 ms. Remains : 123/123 places, 1327/1327 transitions.
Support contains 117 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:47:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:27] [INFO ] Invariant cache hit.
[2023-03-12 10:47:27] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
[2023-03-12 10:47:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:27] [INFO ] Invariant cache hit.
[2023-03-12 10:47:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 10:47:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:27] [INFO ] Invariant cache hit.
[2023-03-12 10:47:27] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-12 10:47:27] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:27] [INFO ] Invariant cache hit.
[2023-03-12 10:47:28] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1131 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 finished in 32359 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((G((G(p1)||p0)) U p2)))'
Support contains 67 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 215 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:47:28] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-12 10:47:28] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:47:29] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
[2023-03-12 10:47:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:29] [INFO ] Invariant cache hit.
[2023-03-12 10:47:29] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 10:47:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:29] [INFO ] Invariant cache hit.
[2023-03-12 10:47:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:29] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-12 10:47:29] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-12 10:47:29] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:29] [INFO ] Invariant cache hit.
[2023-03-12 10:47:30] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1608 ms. Remains : 125/125 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s110 1), p0:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s45 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2967 steps with 7 reset in 194 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-02 finished in 2067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))||G(!p1)) U G(p2))))'
Support contains 66 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:47:30] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:30] [INFO ] Invariant cache hit.
[2023-03-12 10:47:31] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-12 10:47:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:31] [INFO ] Invariant cache hit.
[2023-03-12 10:47:31] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 10:47:31] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:31] [INFO ] Invariant cache hit.
[2023-03-12 10:47:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:31] [INFO ] Implicit Places using invariants and state equation in 623 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 757 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1248 ms. Remains : 124/125 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s107 1) (GEQ s115 1)) (AND (GEQ s107 1) (GEQ s114 1)) (AND (GEQ s107 1) (GEQ s117 1)) (AND (GEQ s107 1) (GEQ s116 1)) (AND (GEQ s107 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4752 reset in 1211 ms.
Product exploration explored 100000 steps with 4907 reset in 1132 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 928 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:47:36] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:47:36] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:47:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:47:36] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (AND p2 p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p2 (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 6 factoid took 1097 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:47:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:38] [INFO ] Invariant cache hit.
[2023-03-12 10:47:38] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
[2023-03-12 10:47:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:38] [INFO ] Invariant cache hit.
[2023-03-12 10:47:38] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-12 10:47:38] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:38] [INFO ] Invariant cache hit.
[2023-03-12 10:47:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:39] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-12 10:47:39] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:39] [INFO ] Invariant cache hit.
[2023-03-12 10:47:39] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1423 ms. Remains : 124/124 places, 1328/1328 transitions.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 642 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 899 steps, including 2 resets, run visited all 9 properties in 41 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p0), (F (NOT p1)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 915 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4934 reset in 1319 ms.
Product exploration explored 100000 steps with 4874 reset in 982 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 1328
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 139 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:47:45] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:47:45] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:47:45] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
[2023-03-12 10:47:45] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-12 10:47:45] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:45] [INFO ] Invariant cache hit.
[2023-03-12 10:47:46] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 1328/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1130 ms. Remains : 124/124 places, 1328/1328 transitions.
Support contains 66 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1328/1328 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:47:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 124 cols
[2023-03-12 10:47:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:47:46] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
[2023-03-12 10:47:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:46] [INFO ] Invariant cache hit.
[2023-03-12 10:47:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-12 10:47:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:46] [INFO ] Invariant cache hit.
[2023-03-12 10:47:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:47] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-12 10:47:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:47:47] [INFO ] Invariant cache hit.
[2023-03-12 10:47:47] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1414 ms. Remains : 124/124 places, 1328/1328 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 finished in 17132 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 53 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 78 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:47:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:47:47] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:47:48] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
[2023-03-12 10:47:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:48] [INFO ] Invariant cache hit.
[2023-03-12 10:47:48] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-12 10:47:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:48] [INFO ] Invariant cache hit.
[2023-03-12 10:47:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:48] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-12 10:47:48] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 10:47:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:48] [INFO ] Invariant cache hit.
[2023-03-12 10:47:49] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/125 places, 1327/1328 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1647 ms. Remains : 124/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s45 1) (GEQ s52 1) (GEQ s54 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5376 reset in 555 ms.
Product exploration explored 100000 steps with 5470 reset in 537 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 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 38 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 113 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-12 10:47:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:50] [INFO ] Invariant cache hit.
[2023-03-12 10:47:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:47:52] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-12 10:47:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:47:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:47:53] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-12 10:47:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 46 ms returned sat
[2023-03-12 10:47:53] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 57 ms.
[2023-03-12 10:47:53] [INFO ] Added : 26 causal constraints over 6 iterations in 176 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 82 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:47:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:53] [INFO ] Invariant cache hit.
[2023-03-12 10:47:53] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
[2023-03-12 10:47:53] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:53] [INFO ] Invariant cache hit.
[2023-03-12 10:47:54] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-12 10:47:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:54] [INFO ] Invariant cache hit.
[2023-03-12 10:47:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:54] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-12 10:47:54] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 10:47:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:54] [INFO ] Invariant cache hit.
[2023-03-12 10:47:54] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1642 ms. Remains : 124/124 places, 1327/1327 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 82 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 24 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 100 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 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-12 10:47:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:55] [INFO ] Invariant cache hit.
[2023-03-12 10:47:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:47:56] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 10:47:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:47:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:47:57] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-12 10:47:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 45 ms returned sat
[2023-03-12 10:47:57] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 48 ms.
[2023-03-12 10:47:57] [INFO ] Added : 26 causal constraints over 6 iterations in 212 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5283 reset in 695 ms.
Product exploration explored 100000 steps with 5502 reset in 545 ms.
Support contains 53 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1327/1327 transitions.
Applied a total of 0 rules in 64 ms. Remains 124 /124 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:47:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:58] [INFO ] Invariant cache hit.
[2023-03-12 10:47:59] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
[2023-03-12 10:47:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:59] [INFO ] Invariant cache hit.
[2023-03-12 10:47:59] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 10:47:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:59] [INFO ] Invariant cache hit.
[2023-03-12 10:47:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:47:59] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-12 10:47:59] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 10:47:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:47:59] [INFO ] Invariant cache hit.
[2023-03-12 10:48:00] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1508 ms. Remains : 124/124 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-06 finished in 12448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 9 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:00] [INFO ] Invariant cache hit.
[2023-03-12 10:48:00] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
[2023-03-12 10:48:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:00] [INFO ] Invariant cache hit.
[2023-03-12 10:48:00] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 10:48:00] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:00] [INFO ] Invariant cache hit.
[2023-03-12 10:48:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:01] [INFO ] Implicit Places using invariants and state equation in 487 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 667 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1086 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s44 1) (GEQ s55 1) (GEQ s56 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-08 finished in 1277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 11 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:01] [INFO ] Invariant cache hit.
[2023-03-12 10:48:01] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
[2023-03-12 10:48:01] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:01] [INFO ] Invariant cache hit.
[2023-03-12 10:48:02] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-12 10:48:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:02] [INFO ] Invariant cache hit.
[2023-03-12 10:48:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:02] [INFO ] Implicit Places using invariants and state equation in 484 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 686 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1059 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s98 1) (GEQ s111 1)), p0:(AND (GEQ s107 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-09 finished in 1195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(p2)&&p1)))'
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 9 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:02] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:02] [INFO ] Invariant cache hit.
[2023-03-12 10:48:03] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2023-03-12 10:48:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:03] [INFO ] Invariant cache hit.
[2023-03-12 10:48:03] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-12 10:48:03] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:03] [INFO ] Invariant cache hit.
[2023-03-12 10:48:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:03] [INFO ] Implicit Places using invariants and state equation in 519 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 688 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1111 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s107 1) (GEQ s122 1)), p0:(AND (GEQ s17 1) (GEQ s55 1) (GEQ s56 1) (GEQ s115 1)), p2:(AND (GEQ s53 50) (GEQ s109 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 236 reset in 500 ms.
Product exploration explored 100000 steps with 236 reset in 620 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 925 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 10:48:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:06] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:48:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:07] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 10:48:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:48:07] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 10:48:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:07] [INFO ] After 114ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 10:48:07] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 10:48:07] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:07] [INFO ] Invariant cache hit.
[2023-03-12 10:48:08] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 387576 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 387576 steps, saw 105862 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 10:48:11] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:11] [INFO ] Invariant cache hit.
[2023-03-12 10:48:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:48:11] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:48:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:48:12] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:48:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:12] [INFO ] After 685ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:48:13] [INFO ] After 841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-12 10:48:13] [INFO ] After 1199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 67 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:13] [INFO ] Invariant cache hit.
[2023-03-12 10:48:13] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-12 10:48:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:13] [INFO ] Invariant cache hit.
[2023-03-12 10:48:13] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-12 10:48:13] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-12 10:48:13] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:13] [INFO ] Invariant cache hit.
[2023-03-12 10:48:14] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1149 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
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 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Applied a total of 1084 rules in 12 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 10:48:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:48:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:14] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:48:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:48:14] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:48:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:48:14] [INFO ] After 83ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:48:14] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-12 10:48:14] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 23 factoid took 1222 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
[2023-03-12 10:48:16] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:48:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:17] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-12 10:48:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:17] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-12 10:48:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:18] [INFO ] [Nat]Added 22 Read/Feed constraints in 470 ms returned sat
[2023-03-12 10:48:18] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 52 ms.
[2023-03-12 10:48:18] [INFO ] Added : 10 causal constraints over 2 iterations in 133 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-12 10:48:18] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:18] [INFO ] Invariant cache hit.
[2023-03-12 10:48:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:18] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-12 10:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:19] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-12 10:48:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:19] [INFO ] [Nat]Added 22 Read/Feed constraints in 476 ms returned sat
[2023-03-12 10:48:19] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-12 10:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-12 10:48:19] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 52 ms.
[2023-03-12 10:48:20] [INFO ] Added : 11 causal constraints over 5 iterations in 302 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:20] [INFO ] Invariant cache hit.
[2023-03-12 10:48:20] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
[2023-03-12 10:48:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:20] [INFO ] Invariant cache hit.
[2023-03-12 10:48:20] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-12 10:48:20] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:20] [INFO ] Invariant cache hit.
[2023-03-12 10:48:21] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-12 10:48:21] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:21] [INFO ] Invariant cache hit.
[2023-03-12 10:48:21] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1309 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p1))), true, (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 558 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:48:22] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:22] [INFO ] Invariant cache hit.
[2023-03-12 10:48:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:48:22] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:48:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:22] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:48:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:23] [INFO ] After 159ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:48:23] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 10:48:23] [INFO ] After 572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 58 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:23] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:23] [INFO ] Invariant cache hit.
[2023-03-12 10:48:23] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 478 ms. Remains : 123/123 places, 1327/1327 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 376276 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376276 steps, saw 102912 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:48:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:26] [INFO ] Invariant cache hit.
[2023-03-12 10:48:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:27] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:48:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:27] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:48:27] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:27] [INFO ] After 197ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:48:27] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-12 10:48:27] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 78 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 66 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:28] [INFO ] Invariant cache hit.
[2023-03-12 10:48:28] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-12 10:48:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:28] [INFO ] Invariant cache hit.
[2023-03-12 10:48:28] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-12 10:48:28] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 10:48:28] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:28] [INFO ] Invariant cache hit.
[2023-03-12 10:48:29] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 123/123 places, 1327/1327 transitions.
Ensure Unique test removed 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 123 transition count 249
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 1 with 2 rules applied. Total rules applied 1080 place count 122 transition count 248
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1082 place count 122 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1084 place count 120 transition count 246
Applied a total of 1084 rules in 11 ms. Remains 120 /123 variables (removed 3) and now considering 246/1327 (removed 1081) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 246 rows 120 cols
[2023-03-12 10:48:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:48:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:29] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 10:48:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:29] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:48:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:48:29] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:48:29] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 10:48:29] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) p1))), true, (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 16 factoid took 740 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
[2023-03-12 10:48:30] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:48:30] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:48:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:31] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-12 10:48:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:31] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-12 10:48:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 573 ms returned sat
[2023-03-12 10:48:32] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 57 ms.
[2023-03-12 10:48:32] [INFO ] Added : 10 causal constraints over 2 iterations in 177 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-12 10:48:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:32] [INFO ] Invariant cache hit.
[2023-03-12 10:48:32] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:33] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-12 10:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:33] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2023-03-12 10:48:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 549 ms returned sat
[2023-03-12 10:48:34] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-12 10:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-12 10:48:34] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 45 ms.
[2023-03-12 10:48:34] [INFO ] Added : 11 causal constraints over 5 iterations in 423 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Product exploration explored 100000 steps with 236 reset in 577 ms.
Product exploration explored 100000 steps with 236 reset in 536 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p2) p0), true, p0, (NOT p2)]
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 68 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:36] [INFO ] Invariant cache hit.
[2023-03-12 10:48:37] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
[2023-03-12 10:48:37] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 10:48:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:37] [INFO ] Invariant cache hit.
[2023-03-12 10:48:37] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1014 ms. Remains : 123/123 places, 1327/1327 transitions.
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:37] [INFO ] Invariant cache hit.
[2023-03-12 10:48:37] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
[2023-03-12 10:48:37] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:37] [INFO ] Invariant cache hit.
[2023-03-12 10:48:38] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-12 10:48:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:38] [INFO ] Invariant cache hit.
[2023-03-12 10:48:38] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-12 10:48:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:38] [INFO ] Invariant cache hit.
[2023-03-12 10:48:38] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1218 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-12 finished in 36198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F((p1||G(p0)))))'
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 137 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:48:39] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:48:39] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
[2023-03-12 10:48:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:39] [INFO ] Invariant cache hit.
[2023-03-12 10:48:39] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-12 10:48:39] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:39] [INFO ] Invariant cache hit.
[2023-03-12 10:48:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:40] [INFO ] Implicit Places using invariants and state equation in 581 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 787 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 94 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1434 ms. Remains : 123/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1)), p1:(GEQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3729 reset in 413 ms.
Product exploration explored 100000 steps with 3807 reset in 393 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 429 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 526 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2023-03-12 10:48:42] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:42] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:48:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 10 factoid took 188 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-13 finished in 4514 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(p1)||p0))))'
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 17 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:48:43] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:48:43] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
[2023-03-12 10:48:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:43] [INFO ] Invariant cache hit.
[2023-03-12 10:48:44] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-12 10:48:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:44] [INFO ] Invariant cache hit.
[2023-03-12 10:48:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:44] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-12 10:48:44] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:44] [INFO ] Invariant cache hit.
[2023-03-12 10:48:45] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1327/1328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1742 ms. Remains : 124/125 places, 1327/1328 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s55 1) (LT s65 1) (LT s121 1)), p0:(OR (LT s26 1) (LT s52 1) (LT s54 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 642 ms.
Product exploration explored 100000 steps with 50000 reset in 601 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-14 finished in 3230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((!p1||X((X(X(!p2)) U (!p1&&X(X(!p2)))))))))'
Support contains 7 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-12 10:48:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2023-03-12 10:48:46] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:48:47] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
[2023-03-12 10:48:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:48:47] [INFO ] Invariant cache hit.
[2023-03-12 10:48:47] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-12 10:48:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2023-03-12 10:48:47] [INFO ] Invariant cache hit.
[2023-03-12 10:48:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:47] [INFO ] Implicit Places using invariants and state equation in 532 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 708 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1165 ms. Remains : 124/125 places, 1328/1328 transitions.
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR p2 p1), p2, p2, true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=(AND p0 p2), acceptance={} source=9 dest: 10}], [{ cond=(NOT p0), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s55 1) (GEQ s56 1) (GEQ s123 1)), p1:(GEQ s52 1), p2:(AND (GEQ s0 1) (GEQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 571 ms.
Product exploration explored 100000 steps with 50000 reset in 560 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/124 stabilizing places and 204/1328 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 11 factoid took 197 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-15 finished in 2963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(p1&&X(G(p2)))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-00
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Support contains 117 out of 125 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 28 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:48:49] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:48:50] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
[2023-03-12 10:48:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:50] [INFO ] Invariant cache hit.
[2023-03-12 10:48:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 10:48:50] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:50] [INFO ] Invariant cache hit.
[2023-03-12 10:48:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:50] [INFO ] Implicit Places using invariants and state equation in 249 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 332 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 905 ms. Remains : 123/125 places, 1327/1328 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s53 50) (GEQ s109 1)) (AND (GEQ s53 50) (GEQ s110 1))), p0:(AND (OR (LT s33 1) (LT s55 1) (LT s56 1) (LT s115 1)) (OR (LT s36 1) (LT s55 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 43163 steps with 10819 reset in 428 ms.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 finished in 1708 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))||G(!p1)) U G(p2))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 66 out of 125 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 125/125 places, 1328/1328 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 1327
Applied a total of 2 rules in 17 ms. Remains 124 /125 variables (removed 1) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:51] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 124 cols
[2023-03-12 10:48:51] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:48:52] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
[2023-03-12 10:48:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:52] [INFO ] Invariant cache hit.
[2023-03-12 10:48:52] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-12 10:48:52] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:52] [INFO ] Invariant cache hit.
[2023-03-12 10:48:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:52] [INFO ] Implicit Places using invariants and state equation in 718 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 829 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 123/125 places, 1327/1328 transitions.
Applied a total of 0 rules in 11 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1342 ms. Remains : 123/125 places, 1327/1328 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s106 1) (GEQ s114 1)) (AND (GEQ s106 1) (GEQ s113 1)) (AND (GEQ s106 1) (GEQ s116 1)) (AND (GEQ s106 1) (GEQ s115 1)) (AND (GEQ s106 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5794 reset in 1135 ms.
Product exploration explored 100000 steps with 5715 reset in 1094 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 764 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2 p1), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 26 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:48:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:56] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:48:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:57] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p2 (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (NOT (AND p2 p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND p2 (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 6 factoid took 1177 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:58] [INFO ] Invariant cache hit.
[2023-03-12 10:48:59] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2023-03-12 10:48:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:59] [INFO ] Invariant cache hit.
[2023-03-12 10:48:59] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-12 10:48:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:59] [INFO ] Invariant cache hit.
[2023-03-12 10:48:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:59] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-12 10:48:59] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:59] [INFO ] Invariant cache hit.
[2023-03-12 10:49:00] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1369 ms. Remains : 123/123 places, 1327/1327 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/123 stabilizing places and 203/1327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 837 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 17 steps, including 0 resets, run visited all 9 properties in 4 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p0), (F (NOT p1)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 736 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5598 reset in 1250 ms.
Product exploration explored 100000 steps with 5542 reset in 1075 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1))]
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 117 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:49:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:49:05] [INFO ] Invariant cache hit.
[2023-03-12 10:49:06] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
[2023-03-12 10:49:06] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 10:49:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:49:06] [INFO ] Invariant cache hit.
[2023-03-12 10:49:06] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1017 ms. Remains : 123/123 places, 1327/1327 transitions.
Support contains 66 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:49:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:49:06] [INFO ] Invariant cache hit.
[2023-03-12 10:49:07] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
[2023-03-12 10:49:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:49:07] [INFO ] Invariant cache hit.
[2023-03-12 10:49:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-12 10:49:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:49:07] [INFO ] Invariant cache hit.
[2023-03-12 10:49:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:49:07] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-12 10:49:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:49:07] [INFO ] Invariant cache hit.
[2023-03-12 10:49:07] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1300 ms. Remains : 123/123 places, 1327/1327 transitions.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLFireability-03 finished in 16722 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (X(p2)&&p1)))'
[2023-03-12 10:49:08] [INFO ] Flatten gal took : 102 ms
[2023-03-12 10:49:08] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2023-03-12 10:49:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 1328 transitions and 9907 arcs took 11 ms.
Total runtime 154827 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3201/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393356 kB
MemFree: 8597012 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16121184 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3201/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3201/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3201/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N10-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N10-LTLFireability-06
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N10-LTLFireability-12

BK_STOP 1678619043673

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BridgeAndVehicles-PT-V50P50N10-LTLFireability-00
ltl formula formula --ltl=/tmp/3201/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 125 places, 1328 transitions and 9907 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.170 real 0.040 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3201/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3201/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3201/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3201/ltl_0_
Killing (15) : 3207 3208 3209 3210 3211
Killing (9) : 3207 3208 3209 3210 3211
ltl formula name BridgeAndVehicles-PT-V50P50N10-LTLFireability-03
ltl formula formula --ltl=/tmp/3201/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 125 places, 1328 transitions and 9907 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.170 real 0.060 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3201/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3201/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3201/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3201/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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) [0x5602e85d43f4]
1: pnml2lts-mc(+0xa2496) [0x5602e85d4496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fba19399140]
3: pnml2lts-mc(+0x405be5) [0x5602e8937be5]
4: pnml2lts-mc(+0x16b3f9) [0x5602e869d3f9]
5: pnml2lts-mc(+0x164ac4) [0x5602e8696ac4]
6: pnml2lts-mc(+0x272e0a) [0x5602e87a4e0a]
7: pnml2lts-mc(+0xb61f0) [0x5602e85e81f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fba191ec4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fba191ec67a]
10: pnml2lts-mc(+0xa1581) [0x5602e85d3581]
11: pnml2lts-mc(+0xa1910) [0x5602e85d3910]
12: pnml2lts-mc(+0xa32a2) [0x5602e85d52a2]
13: pnml2lts-mc(+0x8e039) [0x5602e85c0039]
14: pnml2lts-mc(+0x8f01d) [0x5602e85c101d]
15: pnml2lts-mc(+0x7fedb) [0x5602e85b1edb]
16: pnml2lts-mc(+0x6095d) [0x5602e859295d]
17: pnml2lts-mc(+0x609f0) [0x5602e85929f0]
18: pnml2lts-mc(+0x5eb0a) [0x5602e8590b0a]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fba191d4d0a]
20: pnml2lts-mc(+0x6075e) [0x5602e859275e]
ltl formula name BridgeAndVehicles-PT-V50P50N10-LTLFireability-06
ltl formula formula --ltl=/tmp/3201/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 125 places, 1328 transitions and 9907 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.150 real 0.060 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3201/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3201/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3201/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3201/ltl_2_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
*** 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) [0x5654b44553f4]
0: pnml2lts-mc(+0xa23f4) [0x5654b44553f4]
1: pnml2lts-mc(+0xa2496) [0x5654b4455496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe289d9c140]
3: pnml2lts-mc(+0x405be5) [0x5654b47b8be5]
1: pnml2lts-mc(+0xa2496) [0x5654b4455496]
4: pnml2lts-mc(+0x16b3f9) [0x5654b451e3f9]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe289d9c140]
5: pnml2lts-mc(+0x164ac4) [0x5654b4517ac4]
3: pnml2lts-mc(+0x405be5) [0x5654b47b8be5]
6: pnml2lts-mc(+0x272e0a) [0x5654b4625e0a]
4: pnml2lts-mc(+0x16b3f9) [0x5654b451e3f9]
7: pnml2lts-mc(+0xb61f0) [0x5654b44691f0]
5: pnml2lts-mc(+0x164ac4) [0x5654b4517ac4]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe289bef4d7]
6: pnml2lts-mc(+0x272e0a) [0x5654b4625e0a]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe289bef67a]
7: pnml2lts-mc(+0xb61f0) [0x5654b44691f0]
10: pnml2lts-mc(+0xa1581) [0x5654b4454581]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe289bef4d7]
11: pnml2lts-mc(+0xa1910) [0x5654b4454910]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe289bef67a]
12: pnml2lts-mc(+0xa32a2) [0x5654b44562a2]
10: pnml2lts-mc(+0xa1581) [0x5654b4454581]
13: pnml2lts-mc(+0x8e039) [0x5654b4441039]
11: pnml2lts-mc(+0xa1910) [0x5654b4454910]
14: pnml2lts-mc(+0x8f01d) [0x5654b444201d]
12: pnml2lts-mc(+0xa32a2) [0x5654b44562a2]
15: pnml2lts-mc(+0x7fedb) [0x5654b4432edb]
13: pnml2lts-mc(+0x8e039) [0x5654b4441039]
16: pnml2lts-mc(+0x6095d) [0x5654b441395d]
14: pnml2lts-mc(+0x8f01d) [0x5654b444201d]
17: pnml2lts-mc(+0x609f0) [0x5654b44139f0]
15: pnml2lts-mc(+0x7fedb) [0x5654b4432edb]
18: pnml2lts-mc(+0x5eb0a) [0x5654b4411b0a]
16: pnml2lts-mc(+0x6095d) [0x5654b441395d]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe289bd7d0a]
20: pnml2lts-mc(+0x6075e) [0x5654b441375e]
17: pnml2lts-mc(+0x609f0) [0x5654b44139f0]
18: pnml2lts-mc(+0x5eb0a) [0x5654b4411b0a]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe289bd7d0a]
20: pnml2lts-mc(+0x6075e) [0x5654b441375e]
ltl formula name BridgeAndVehicles-PT-V50P50N10-LTLFireability-12
ltl formula formula --ltl=/tmp/3201/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 125 places, 1328 transitions and 9907 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.140 real 0.040 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3201/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3201/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3201/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3201/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 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:

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-V50P50N10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P50N10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694400252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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