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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 15K Feb 25 12:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 385K Feb 25 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 12:12 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 9.7K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 404K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 25 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 226K Feb 25 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 463K Feb 25 12:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Feb 25 12:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K 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.9M 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-V20P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678614744618

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-V20P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:52:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 09:52:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:52:26] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2023-03-12 09:52:26] [INFO ] Transformed 108 places.
[2023-03-12 09:52:26] [INFO ] Transformed 2228 transitions.
[2023-03-12 09:52:26] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 38 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:52:27] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:52:27] [INFO ] Computed 5 place invariants in 32 ms
[2023-03-12 09:52:28] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
[2023-03-12 09:52:28] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:52:28] [INFO ] Invariant cache hit.
[2023-03-12 09:52:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-12 09:52:28] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:52:28] [INFO ] Invariant cache hit.
[2023-03-12 09:52:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:28] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-12 09:52:28] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:52:28] [INFO ] Invariant cache hit.
[2023-03-12 09:52:29] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2094 ms. Remains : 106/108 places, 2228/2228 transitions.
Support contains 105 out of 106 places after structural reductions.
[2023-03-12 09:52:29] [INFO ] Flatten gal took : 236 ms
[2023-03-12 09:52:30] [INFO ] Flatten gal took : 255 ms
[2023-03-12 09:52:31] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 09:52:32] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:52:32] [INFO ] Invariant cache hit.
[2023-03-12 09:52:32] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:52:33] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-12 09:52:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:52:33] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 09:52:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:33] [INFO ] After 262ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-12 09:52:34] [INFO ] After 655ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-12 09:52:34] [INFO ] After 1291ms 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 75 ms.
Support contains 11 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
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 103 transition count 2226
Applied a total of 5 rules in 516 ms. Remains 103 /106 variables (removed 3) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 517 ms. Remains : 103/106 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 183328 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{1=1}
Probabilistic random walk after 183328 steps, saw 53196 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :1
Running SMT prover for 3 properties.
[2023-03-12 09:52:38] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2023-03-12 09:52:38] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 09:52:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:52:39] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:52:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:52:39] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:39] [INFO ] After 209ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:39] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-12 09:52:39] [INFO ] After 822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 254 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 103/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 214795 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214795 steps, saw 61876 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:52:43] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:52:43] [INFO ] Invariant cache hit.
[2023-03-12 09:52:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:52:44] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:52:44] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:44] [INFO ] After 221ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:44] [INFO ] After 405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-12 09:52:44] [INFO ] After 838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 260 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 228 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 09:52:45] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:52:45] [INFO ] Invariant cache hit.
[2023-03-12 09:52:45] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 09:52:45] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:52:45] [INFO ] Invariant cache hit.
[2023-03-12 09:52:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:47] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1640 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 241 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2112 ms. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 221862 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 221862 steps, saw 64333 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:52:50] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2023-03-12 09:52:50] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 09:52:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:52:51] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:52:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:52:51] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:51] [INFO ] After 236ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:51] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-12 09:52:52] [INFO ] After 921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 200 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 197 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 09:52:52] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:52:52] [INFO ] Invariant cache hit.
[2023-03-12 09:52:52] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-12 09:52:52] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:52:52] [INFO ] Invariant cache hit.
[2023-03-12 09:52:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:53] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2023-03-12 09:52:53] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-12 09:52:53] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 09:52:53] [INFO ] Invariant cache hit.
[2023-03-12 09:52:54] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2169 ms. Remains : 101/101 places, 2226/2226 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 101 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 99 transition count 286
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 99 transition count 286
Applied a total of 1943 rules in 18 ms. Remains 99 /101 variables (removed 2) and now considering 286/2226 (removed 1940) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 286 rows 99 cols
[2023-03-12 09:52:54] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 09:52:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:52:54] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 09:52:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:52:54] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:52:54] [INFO ] After 46ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:52:54] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-12 09:52:55] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 49 stabilizing places and 84 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((p0 U p1))||G(!p1)))'
Support contains 74 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:52:55] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:52:55] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:52:56] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
[2023-03-12 09:52:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:52:56] [INFO ] Invariant cache hit.
[2023-03-12 09:52:56] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-12 09:52:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:52:56] [INFO ] Invariant cache hit.
[2023-03-12 09:52:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:52:57] [INFO ] Implicit Places using invariants and state equation in 613 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 789 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1523 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 331 ms :[true, (NOT p1), false, false, p1]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s20 1) (GEQ s25 1) (GEQ s26 1) (GEQ s93 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s26 1) (GEQ s99 1)) (AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 0 reset in 24 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-00 finished in 2001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 16 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:52:57] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:52:57] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:52:58] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
[2023-03-12 09:52:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:52:58] [INFO ] Invariant cache hit.
[2023-03-12 09:52:58] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-12 09:52:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:52:58] [INFO ] Invariant cache hit.
[2023-03-12 09:52:58] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 564 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1438 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s55 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s28 1) (GEQ s78 1)) (AND (GEQ s1 1) (GEQ s24 1) (GEQ s33 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-01 finished in 1583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 23 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 542 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:52:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:52:59] [INFO ] Invariant cache hit.
[2023-03-12 09:53:00] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
[2023-03-12 09:53:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:00] [INFO ] Invariant cache hit.
[2023-03-12 09:53:00] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-12 09:53:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:00] [INFO ] Invariant cache hit.
[2023-03-12 09:53:01] [INFO ] Implicit Places using invariants and state equation in 599 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 826 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 225 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2382 ms. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s23 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s36 1) (GEQ s47 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s41 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1308 reset in 946 ms.
Product exploration explored 100000 steps with 1275 reset in 810 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2023-03-12 09:53:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-12 09:53:03] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:53:04] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-12 09:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:53:04] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-12 09:53:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:53:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 09:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:53:05] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-12 09:53:05] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:05] [INFO ] [Nat]Added 102 Read/Feed constraints in 45 ms returned sat
[2023-03-12 09:53:06] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 196 ms.
[2023-03-12 09:53:06] [INFO ] Added : 60 causal constraints over 12 iterations in 499 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 242 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:53:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:06] [INFO ] Invariant cache hit.
[2023-03-12 09:53:07] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
[2023-03-12 09:53:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:07] [INFO ] Invariant cache hit.
[2023-03-12 09:53:07] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-12 09:53:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:07] [INFO ] Invariant cache hit.
[2023-03-12 09:53:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:08] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-12 09:53:08] [INFO ] Redundant transitions in 133 ms returned []
[2023-03-12 09:53:08] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:08] [INFO ] Invariant cache hit.
[2023-03-12 09:53:09] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2903 ms. Remains : 104/104 places, 2227/2227 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-12 09:53:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:09] [INFO ] Invariant cache hit.
[2023-03-12 09:53:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:53:10] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-12 09:53:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:53:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 09:53:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:53:11] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-12 09:53:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:11] [INFO ] [Nat]Added 102 Read/Feed constraints in 26 ms returned sat
[2023-03-12 09:53:11] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 122 ms.
[2023-03-12 09:53:11] [INFO ] Added : 58 causal constraints over 13 iterations in 392 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1282 reset in 731 ms.
Product exploration explored 100000 steps with 1306 reset in 744 ms.
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 198 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:53:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:13] [INFO ] Invariant cache hit.
[2023-03-12 09:53:14] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
[2023-03-12 09:53:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:14] [INFO ] Invariant cache hit.
[2023-03-12 09:53:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-12 09:53:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:14] [INFO ] Invariant cache hit.
[2023-03-12 09:53:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:15] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2023-03-12 09:53:15] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-12 09:53:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:15] [INFO ] Invariant cache hit.
[2023-03-12 09:53:16] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2991 ms. Remains : 104/104 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-02 finished in 17865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(!p1))) U (p1&&F(p2)&&X(p0))))'
Support contains 77 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:53:16] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:53:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:53:17] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2023-03-12 09:53:17] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:53:17] [INFO ] Invariant cache hit.
[2023-03-12 09:53:17] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-12 09:53:17] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:53:17] [INFO ] Invariant cache hit.
[2023-03-12 09:53:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:18] [INFO ] Implicit Places using invariants and state equation in 550 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 685 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1384 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s49 1), p2:(OR (AND (GEQ s23 20) (GEQ s51 1)) (AND (GEQ s23 20) (GEQ s50 1))), p1:(OR (AND (GEQ s1 1) (GEQ s24 1) (GEQ s31 1) (GEQ s56 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-03 finished in 1711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 23 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 217 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:53:18] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:53:18] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:53:19] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
[2023-03-12 09:53:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:19] [INFO ] Invariant cache hit.
[2023-03-12 09:53:19] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-12 09:53:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:19] [INFO ] Invariant cache hit.
[2023-03-12 09:53:20] [INFO ] Implicit Places using invariants and state equation in 498 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 735 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 268 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2018 ms. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s19 1) (LT s22 1) (LT s24 1) (LT s25 1)) (OR (LT s18 1) (LT s22 1) (LT s24 1) (LT s25 1)) (OR (LT s9 1) (LT s22 1) (LT s24 1) (LT s25 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 602 reset in 953 ms.
Product exploration explored 100000 steps with 602 reset in 798 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 242 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:53:23] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-12 09:53:23] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:53:24] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
[2023-03-12 09:53:24] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:24] [INFO ] Invariant cache hit.
[2023-03-12 09:53:24] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-12 09:53:24] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:24] [INFO ] Invariant cache hit.
[2023-03-12 09:53:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:25] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2023-03-12 09:53:25] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 09:53:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:25] [INFO ] Invariant cache hit.
[2023-03-12 09:53:26] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3597 ms. Remains : 104/104 places, 2227/2227 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 602 reset in 841 ms.
Product exploration explored 100000 steps with 602 reset in 1062 ms.
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 218 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:53:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:29] [INFO ] Invariant cache hit.
[2023-03-12 09:53:29] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
[2023-03-12 09:53:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:29] [INFO ] Invariant cache hit.
[2023-03-12 09:53:30] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-12 09:53:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:30] [INFO ] Invariant cache hit.
[2023-03-12 09:53:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:31] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
[2023-03-12 09:53:31] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 09:53:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:31] [INFO ] Invariant cache hit.
[2023-03-12 09:53:32] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3241 ms. Remains : 104/104 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-04 finished in 13758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1)) U p2)))'
Support contains 26 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:53:32] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:53:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:53:33] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
[2023-03-12 09:53:33] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:53:33] [INFO ] Invariant cache hit.
[2023-03-12 09:53:33] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-12 09:53:33] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:53:33] [INFO ] Invariant cache hit.
[2023-03-12 09:53:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:34] [INFO ] Implicit Places using invariants and state equation in 797 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1019 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1813 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s23 20) (GEQ s51 1)) (AND (GEQ s23 20) (GEQ s50 1))), p0:(OR (AND (GEQ s30 1) (GEQ s52 1)) (AND (GEQ s35 1) (GEQ s52 1)) (AND (GEQ s37 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-05 finished in 2084 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 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:53:34] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:53:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:53:35] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
[2023-03-12 09:53:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:35] [INFO ] Invariant cache hit.
[2023-03-12 09:53:35] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-12 09:53:35] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:53:35] [INFO ] Invariant cache hit.
[2023-03-12 09:53:35] [INFO ] Implicit Places using invariants and state equation in 374 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 567 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1247 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 120 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=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:(OR (AND (GEQ s20 1) (GEQ s25 1) (GEQ s26 1) (GEQ s92 1)) (AND (GEQ s3 1) (GEQ s25 1) (GEQ s26 1) (GEQ s98 1)) (AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 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]]
Product exploration explored 100000 steps with 33333 reset in 2037 ms.
Product exploration explored 100000 steps with 33333 reset in 1856 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-07 finished in 5380 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)||G(p1)))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
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 5 place count 103 transition count 2226
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 101 transition count 2224
Applied a total of 9 rules in 285 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2023-03-12 09:53:40] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2023-03-12 09:53:40] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 09:53:40] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 09:53:40] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:40] [INFO ] Invariant cache hit.
[2023-03-12 09:53:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:41] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1407 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 241 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1936 ms. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s31 1) (LT s47 1)), p0:(OR (LT s4 1) (LT s23 1) (LT s24 1) (LT s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 802 reset in 823 ms.
Product exploration explored 100000 steps with 802 reset in 801 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Detected a total of 44/99 stabilizing places and 82/2224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 548 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 09:53:44] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2023-03-12 09:53:44] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 09:53:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:53:44] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 09:53:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:53:45] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-12 09:53:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:45] [INFO ] After 177ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-12 09:53:45] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-12 09:53:45] [INFO ] After 794ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 206 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 99/99 places, 2224/2224 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 236639 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236639 steps, saw 67891 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:53:49] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:49] [INFO ] Invariant cache hit.
[2023-03-12 09:53:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:53:49] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:53:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:53:50] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:53:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:50] [INFO ] After 169ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:53:50] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-12 09:53:50] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 223 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 99/99 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 209 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:53:50] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:50] [INFO ] Invariant cache hit.
[2023-03-12 09:53:51] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 09:53:51] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:51] [INFO ] Invariant cache hit.
[2023-03-12 09:53:51] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2023-03-12 09:53:51] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 09:53:51] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:51] [INFO ] Invariant cache hit.
[2023-03-12 09:53:52] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1864 ms. Remains : 99/99 places, 2224/2224 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 99 transition count 286
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1939 place count 99 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1940 place count 98 transition count 285
Applied a total of 1940 rules in 11 ms. Remains 98 /99 variables (removed 1) and now considering 285/2224 (removed 1939) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 285 rows 98 cols
[2023-03-12 09:53:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:53:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:53:52] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 09:53:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:53:52] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 09:53:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:53:53] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 09:53:53] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-12 09:53:53] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 16 factoid took 762 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 14 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:53:54] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2023-03-12 09:53:54] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 09:53:54] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-12 09:53:54] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:54] [INFO ] Invariant cache hit.
[2023-03-12 09:53:54] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-12 09:53:54] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:54] [INFO ] Invariant cache hit.
[2023-03-12 09:53:55] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1431 ms. Remains : 99/99 places, 2224/2224 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Detected a total of 44/99 stabilizing places and 82/2224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X (AND p0 p1))), true, (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 317 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 122 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:53:56] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:53:56] [INFO ] Invariant cache hit.
[2023-03-12 09:53:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:53:56] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:53:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:53:56] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:53:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:53:56] [INFO ] After 174ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:53:57] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-12 09:53:57] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 281 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 99/99 places, 2224/2224 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 270716 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270716 steps, saw 77221 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:54:00] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:00] [INFO ] Invariant cache hit.
[2023-03-12 09:54:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:54:00] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:54:00] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:01] [INFO ] After 147ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:01] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 09:54:01] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 187 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 99/99 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 176 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:54:01] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:01] [INFO ] Invariant cache hit.
[2023-03-12 09:54:01] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-12 09:54:01] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:01] [INFO ] Invariant cache hit.
[2023-03-12 09:54:02] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-12 09:54:02] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 09:54:02] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:02] [INFO ] Invariant cache hit.
[2023-03-12 09:54:03] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 99/99 places, 2224/2224 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 99 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 99 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 97 transition count 284
Applied a total of 1942 rules in 12 ms. Remains 97 /99 variables (removed 2) and now considering 284/2224 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 97 cols
[2023-03-12 09:54:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:54:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:54:03] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:54:03] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:54:03] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:03] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 09:54:03] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X p1), (X (X (AND p0 p1))), true, (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 328 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 90 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 802 reset in 790 ms.
Product exploration explored 100000 steps with 802 reset in 778 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 218 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:54:06] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-12 09:54:06] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2023-03-12 09:54:06] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 09:54:07] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1082 ms. Remains : 99/99 places, 2224/2224 transitions.
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 13 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2023-03-12 09:54:07] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:07] [INFO ] Invariant cache hit.
[2023-03-12 09:54:07] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 09:54:07] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:07] [INFO ] Invariant cache hit.
[2023-03-12 09:54:07] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-12 09:54:07] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 09:54:07] [INFO ] Invariant cache hit.
[2023-03-12 09:54:08] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 99/99 places, 2224/2224 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-08 finished in 28951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 16 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:54:08] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:54:08] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:54:09] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
[2023-03-12 09:54:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:09] [INFO ] Invariant cache hit.
[2023-03-12 09:54:09] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-12 09:54:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:09] [INFO ] Invariant cache hit.
[2023-03-12 09:54:10] [INFO ] Implicit Places using invariants and state equation in 542 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 909 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1593 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s23 20) (LT s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1007 ms.
Product exploration explored 100000 steps with 50000 reset in 1085 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-09 finished in 3897 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(G(p1)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 248 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:54:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:54:12] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:54:13] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
[2023-03-12 09:54:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:13] [INFO ] Invariant cache hit.
[2023-03-12 09:54:13] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-12 09:54:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:13] [INFO ] Invariant cache hit.
[2023-03-12 09:54:14] [INFO ] Implicit Places using invariants and state equation in 527 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 781 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 264 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2069 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s22 1), p1:(AND (GEQ s1 1) (GEQ s24 1) (GEQ s27 1) (GEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-11 finished in 2224 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)||G((X(F(p2))||p1))))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:14] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:54:14] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:54:15] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
[2023-03-12 09:54:15] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:15] [INFO ] Invariant cache hit.
[2023-03-12 09:54:15] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-12 09:54:15] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:15] [INFO ] Invariant cache hit.
[2023-03-12 09:54:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:16] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1277 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2090 ms. Remains : 105/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-12 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=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s15 1) (LT s22 1) (LT s24 1) (LT s25 1)), p0:(GEQ s50 1), p2:(OR (LT s15 1) (LT s22 1) (LT s24 1) (LT s25 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25006 reset in 1149 ms.
Product exploration explored 100000 steps with 24995 reset in 947 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 460 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 287 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:54:20] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 09:54:20] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 09:54:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:20] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 09:54:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:20] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 09:54:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:21] [INFO ] After 105ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 09:54:21] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-12 09:54:21] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 254 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:21] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:21] [INFO ] Invariant cache hit.
[2023-03-12 09:54:22] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1067 ms. Remains : 105/105 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279838 steps, run timeout after 3002 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279838 steps, saw 73409 distinct states, run finished after 3004 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:54:25] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:25] [INFO ] Invariant cache hit.
[2023-03-12 09:54:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:25] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:54:25] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:25] [INFO ] After 86ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:26] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-12 09:54:26] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 249 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 105/105 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 217 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:26] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:26] [INFO ] Invariant cache hit.
[2023-03-12 09:54:26] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-12 09:54:26] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:26] [INFO ] Invariant cache hit.
[2023-03-12 09:54:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:28] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2023-03-12 09:54:28] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-12 09:54:28] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:28] [INFO ] Invariant cache hit.
[2023-03-12 09:54:29] [INFO ] Dead Transitions using invariants and state equation in 818 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2578 ms. Remains : 105/105 places, 2228/2228 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 105 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 103 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 103 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 102 transition count 287
Applied a total of 1944 rules in 13 ms. Remains 102 /105 variables (removed 3) and now considering 287/2228 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 102 cols
[2023-03-12 09:54:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:54:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:54:29] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:54:29] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:54:29] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:29] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 09:54:29] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (AND (NOT p1) (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 608 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 279 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 09:54:30] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:54:31] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
[2023-03-12 09:54:31] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:31] [INFO ] Invariant cache hit.
[2023-03-12 09:54:31] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-12 09:54:31] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:31] [INFO ] Invariant cache hit.
[2023-03-12 09:54:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:32] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2023-03-12 09:54:32] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:32] [INFO ] Invariant cache hit.
[2023-03-12 09:54:33] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2903 ms. Remains : 105/105 places, 2228/2228 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:54:34] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:34] [INFO ] Invariant cache hit.
[2023-03-12 09:54:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:34] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:34] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:34] [INFO ] After 93ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:34] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-12 09:54:34] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 236 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:35] [INFO ] Invariant cache hit.
[2023-03-12 09:54:35] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 105/105 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289774 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289774 steps, saw 75476 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:54:38] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:38] [INFO ] Invariant cache hit.
[2023-03-12 09:54:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:39] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:39] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:39] [INFO ] After 81ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:39] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-12 09:54:39] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 280 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 105/105 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 215 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:40] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:40] [INFO ] Invariant cache hit.
[2023-03-12 09:54:40] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-12 09:54:40] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:40] [INFO ] Invariant cache hit.
[2023-03-12 09:54:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:41] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
[2023-03-12 09:54:41] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 09:54:41] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:41] [INFO ] Invariant cache hit.
[2023-03-12 09:54:42] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2754 ms. Remains : 105/105 places, 2228/2228 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 105 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 103 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 103 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 102 transition count 287
Applied a total of 1944 rules in 9 ms. Remains 102 /105 variables (removed 3) and now considering 287/2228 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 102 cols
[2023-03-12 09:54:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:54:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:42] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:54:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:54:42] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:54:42] [INFO ] After 17ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:54:42] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 09:54:42] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25030 reset in 984 ms.
Product exploration explored 100000 steps with 24898 reset in 1140 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 209 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:46] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 09:54:46] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:54:47] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
[2023-03-12 09:54:47] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 09:54:47] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:47] [INFO ] Invariant cache hit.
[2023-03-12 09:54:47] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1644 ms. Remains : 105/105 places, 2228/2228 transitions.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:54:47] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:47] [INFO ] Invariant cache hit.
[2023-03-12 09:54:48] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2023-03-12 09:54:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:48] [INFO ] Invariant cache hit.
[2023-03-12 09:54:48] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-12 09:54:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:48] [INFO ] Invariant cache hit.
[2023-03-12 09:54:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:54:49] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2023-03-12 09:54:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:54:49] [INFO ] Invariant cache hit.
[2023-03-12 09:54:50] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2441 ms. Remains : 105/105 places, 2228/2228 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-12 finished in 35735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 261 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:54:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:54:50] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:54:51] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
[2023-03-12 09:54:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:51] [INFO ] Invariant cache hit.
[2023-03-12 09:54:51] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 09:54:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:51] [INFO ] Invariant cache hit.
[2023-03-12 09:54:52] [INFO ] Implicit Places using invariants and state equation in 630 ms returned [22, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 925 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 240 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2175 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s44 1) (GEQ s51 1)), p1:(GEQ s48 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-13 finished in 2271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 275 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:54:53] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 09:54:53] [INFO ] Computed 5 place invariants in 14 ms
[2023-03-12 09:54:53] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
[2023-03-12 09:54:53] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:53] [INFO ] Invariant cache hit.
[2023-03-12 09:54:54] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-12 09:54:54] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:54] [INFO ] Invariant cache hit.
[2023-03-12 09:54:54] [INFO ] Implicit Places using invariants and state equation in 608 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 983 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 252 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2233 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s23 20) (GEQ s49 1)), p1:(AND (GEQ s48 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V20P20N50-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-14 finished in 2373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 20 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 09:54:55] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:55] [INFO ] Invariant cache hit.
[2023-03-12 09:54:56] [INFO ] Dead Transitions using invariants and state equation in 1032 ms found 0 transitions.
[2023-03-12 09:54:56] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:56] [INFO ] Invariant cache hit.
[2023-03-12 09:54:56] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-12 09:54:56] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:54:56] [INFO ] Invariant cache hit.
[2023-03-12 09:54:57] [INFO ] Implicit Places using invariants and state equation in 658 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1043 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2105 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s47 1) (LT s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 602 reset in 871 ms.
Product exploration explored 100000 steps with 602 reset in 864 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 288677 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288677 steps, saw 75275 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:02] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 09:55:02] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:55:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:02] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:55:02] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:03] [INFO ] After 36ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:03] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 09:55:03] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 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 101 transition count 2226
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 5 place count 100 transition count 2225
Applied a total of 5 rules in 253 ms. Remains 100 /103 variables (removed 3) and now considering 2225/2227 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 100/103 places, 2225/2227 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275972 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275972 steps, saw 78701 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:06] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2023-03-12 09:55:06] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:55:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:55:06] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:06] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:07] [INFO ] After 84ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:07] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-12 09:55:07] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 222 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 100/100 places, 2225/2225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 287 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:55:07] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:55:07] [INFO ] Invariant cache hit.
[2023-03-12 09:55:08] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-12 09:55:08] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:55:08] [INFO ] Invariant cache hit.
[2023-03-12 09:55:08] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:09] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2023-03-12 09:55:09] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 09:55:09] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:55:09] [INFO ] Invariant cache hit.
[2023-03-12 09:55:11] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3577 ms. Remains : 100/100 places, 2225/2225 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 100 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 100 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 98 transition count 285
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 98 transition count 285
Applied a total of 1943 rules in 12 ms. Remains 98 /100 variables (removed 2) and now considering 285/2225 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 98 cols
[2023-03-12 09:55:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:55:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:55:11] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:11] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:55:11] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:11] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 09:55:11] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:55:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 09:55:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:55:12] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
[2023-03-12 09:55:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:12] [INFO ] Invariant cache hit.
[2023-03-12 09:55:12] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-12 09:55:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:12] [INFO ] Invariant cache hit.
[2023-03-12 09:55:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:14] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2239 ms to find 0 implicit places.
[2023-03-12 09:55:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:14] [INFO ] Invariant cache hit.
[2023-03-12 09:55:15] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3999 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272917 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272917 steps, saw 71671 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:19] [INFO ] Invariant cache hit.
[2023-03-12 09:55:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:19] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:19] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:19] [INFO ] After 39ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:19] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 09:55:19] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 101 transition count 2226
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 5 place count 100 transition count 2225
Applied a total of 5 rules in 229 ms. Remains 100 /103 variables (removed 3) and now considering 2225/2227 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 100/103 places, 2225/2227 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 286679 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286679 steps, saw 81689 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:23] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2023-03-12 09:55:23] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 09:55:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:23] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:55:23] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:23] [INFO ] After 50ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:23] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-12 09:55:23] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 229 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 100/100 places, 2225/2225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 209 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:55:24] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:55:24] [INFO ] Invariant cache hit.
[2023-03-12 09:55:24] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-12 09:55:24] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:55:24] [INFO ] Invariant cache hit.
[2023-03-12 09:55:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:25] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2023-03-12 09:55:25] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 09:55:25] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:55:25] [INFO ] Invariant cache hit.
[2023-03-12 09:55:26] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2247 ms. Remains : 100/100 places, 2225/2225 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 100 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 100 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 98 transition count 285
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 98 transition count 285
Applied a total of 1943 rules in 12 ms. Remains 98 /100 variables (removed 2) and now considering 285/2225 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 98 cols
[2023-03-12 09:55:26] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:55:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:55:26] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:26] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:55:26] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:26] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-12 09:55:26] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 602 reset in 633 ms.
Product exploration explored 100000 steps with 602 reset in 659 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 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 103 transition count 2227
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 211 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:55:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 09:55:28] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:55:29] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
[2023-03-12 09:55:29] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-12 09:55:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:29] [INFO ] Invariant cache hit.
[2023-03-12 09:55:30] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 2227/2227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2113 ms. Remains : 103/103 places, 2227/2227 transitions.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 09:55:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 09:55:30] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:55:31] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2023-03-12 09:55:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:31] [INFO ] Invariant cache hit.
[2023-03-12 09:55:31] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-12 09:55:31] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:31] [INFO ] Invariant cache hit.
[2023-03-12 09:55:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:33] [INFO ] Implicit Places using invariants and state equation in 2079 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2023-03-12 09:55:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 09:55:33] [INFO ] Invariant cache hit.
[2023-03-12 09:55:34] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4093 ms. Remains : 103/103 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-15 finished in 39662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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)||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p0)||G((X(F(p2))||p1))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-12
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 33 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:55:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 09:55:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:55:36] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
[2023-03-12 09:55:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:36] [INFO ] Invariant cache hit.
[2023-03-12 09:55:36] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 09:55:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:36] [INFO ] Invariant cache hit.
[2023-03-12 09:55:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:37] [INFO ] Implicit Places using invariants and state equation in 853 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1178 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 18 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2065 ms. Remains : 105/106 places, 2228/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-12 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=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s15 1) (LT s22 1) (LT s24 1) (LT s25 1)), p0:(GEQ s50 1), p2:(OR (LT s15 1) (LT s22 1) (LT s24 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24995 reset in 850 ms.
Product exploration explored 100000 steps with 25063 reset in 853 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 479 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 254 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 09:55:40] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 09:55:40] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 09:55:40] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:40] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 09:55:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:55:41] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 09:55:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:41] [INFO ] After 91ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 09:55:41] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-12 09:55:41] [INFO ] After 439ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 207 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:55:41] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:41] [INFO ] Invariant cache hit.
[2023-03-12 09:55:42] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1254 ms. Remains : 105/105 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 271359 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271359 steps, saw 71277 distinct states, run finished after 3010 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:45] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:45] [INFO ] Invariant cache hit.
[2023-03-12 09:55:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:46] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:46] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:46] [INFO ] After 110ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:46] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-12 09:55:46] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 179 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 105/105 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 243 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:55:46] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:46] [INFO ] Invariant cache hit.
[2023-03-12 09:55:47] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 09:55:47] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:47] [INFO ] Invariant cache hit.
[2023-03-12 09:55:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:48] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2023-03-12 09:55:48] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 09:55:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:48] [INFO ] Invariant cache hit.
[2023-03-12 09:55:49] [INFO ] Dead Transitions using invariants and state equation in 1123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2866 ms. Remains : 105/105 places, 2228/2228 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 105 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 103 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 103 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 102 transition count 287
Applied a total of 1944 rules in 18 ms. Remains 102 /105 variables (removed 3) and now considering 287/2228 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 102 cols
[2023-03-12 09:55:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:55:49] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:49] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:49] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:55:49] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:49] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-12 09:55:50] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p1), true, (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (AND (NOT p1) (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 588 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 323 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:55:51] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 09:55:51] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 09:55:52] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
[2023-03-12 09:55:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:52] [INFO ] Invariant cache hit.
[2023-03-12 09:55:52] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 09:55:52] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:52] [INFO ] Invariant cache hit.
[2023-03-12 09:55:52] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:53] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-12 09:55:53] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:53] [INFO ] Invariant cache hit.
[2023-03-12 09:55:54] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2899 ms. Remains : 105/105 places, 2228/2228 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/105 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10001 steps, including 57 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:54] [INFO ] Invariant cache hit.
[2023-03-12 09:55:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 09:55:55] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:55] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:55:55] [INFO ] After 82ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:55:55] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-12 09:55:55] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 280 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:55:55] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:55] [INFO ] Invariant cache hit.
[2023-03-12 09:55:56] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1017 ms. Remains : 105/105 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279936 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279936 steps, saw 73429 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:55:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:55:59] [INFO ] Invariant cache hit.
[2023-03-12 09:55:59] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 09:55:59] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:55:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:00] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:00] [INFO ] After 72ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:00] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 09:56:00] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 239 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 105/105 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 232 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:56:00] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:00] [INFO ] Invariant cache hit.
[2023-03-12 09:56:01] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 09:56:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:01] [INFO ] Invariant cache hit.
[2023-03-12 09:56:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:02] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-03-12 09:56:02] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-12 09:56:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:02] [INFO ] Invariant cache hit.
[2023-03-12 09:56:03] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2919 ms. Remains : 105/105 places, 2228/2228 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 105 transition count 290
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 103 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 103 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 102 transition count 287
Applied a total of 1944 rules in 12 ms. Remains 102 /105 variables (removed 3) and now considering 287/2228 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 287 rows 102 cols
[2023-03-12 09:56:03] [INFO ] Computed 5 place invariants in 9 ms
[2023-03-12 09:56:03] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-12 09:56:03] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:03] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 09:56:03] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:03] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-12 09:56:03] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1 p2), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p2)), (F p0)]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 24907 reset in 1097 ms.
Product exploration explored 100000 steps with 25019 reset in 919 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 228 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:56:07] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 09:56:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 09:56:08] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
[2023-03-12 09:56:08] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 09:56:08] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:08] [INFO ] Invariant cache hit.
[2023-03-12 09:56:09] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1856 ms. Remains : 105/105 places, 2228/2228 transitions.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 09:56:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:09] [INFO ] Invariant cache hit.
[2023-03-12 09:56:10] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
[2023-03-12 09:56:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:10] [INFO ] Invariant cache hit.
[2023-03-12 09:56:10] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-12 09:56:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:10] [INFO ] Invariant cache hit.
[2023-03-12 09:56:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:11] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-03-12 09:56:11] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 09:56:11] [INFO ] Invariant cache hit.
[2023-03-12 09:56:12] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2960 ms. Remains : 105/105 places, 2228/2228 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-12 finished in 37176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-15
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 102 transition count 2225
Applied a total of 7 rules in 68 ms. Remains 102 /106 variables (removed 4) and now considering 2225/2228 (removed 3) transitions.
[2023-03-12 09:56:12] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 102 cols
[2023-03-12 09:56:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:56:13] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-12 09:56:13] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:13] [INFO ] Invariant cache hit.
[2023-03-12 09:56:13] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:14] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2111 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/106 places, 2225/2228 transitions.
Applied a total of 0 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2195 ms. Remains : 100/106 places, 2225/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s45 1) (LT s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 800 reset in 733 ms.
Product exploration explored 100000 steps with 800 reset in 780 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 287344 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287344 steps, saw 81919 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:56:19] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2023-03-12 09:56:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:56:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:56:20] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:20] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:20] [INFO ] After 73ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:20] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 09:56:20] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 225 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 100/100 places, 2225/2225 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 266653 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266653 steps, saw 76185 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:56:24] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:24] [INFO ] Invariant cache hit.
[2023-03-12 09:56:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:24] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:24] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:24] [INFO ] After 44ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:24] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-12 09:56:24] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 235 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 100/100 places, 2225/2225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 220 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:56:25] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:25] [INFO ] Invariant cache hit.
[2023-03-12 09:56:25] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 09:56:25] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:25] [INFO ] Invariant cache hit.
[2023-03-12 09:56:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:26] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-12 09:56:26] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-12 09:56:26] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:26] [INFO ] Invariant cache hit.
[2023-03-12 09:56:27] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2816 ms. Remains : 100/100 places, 2225/2225 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 100 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 100 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 98 transition count 285
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 98 transition count 285
Applied a total of 1943 rules in 12 ms. Remains 98 /100 variables (removed 2) and now considering 285/2225 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 98 cols
[2023-03-12 09:56:27] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:56:27] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-12 09:56:27] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:56:27] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:56:27] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:27] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-12 09:56:28] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:56:28] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2023-03-12 09:56:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:56:28] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-12 09:56:28] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:28] [INFO ] Invariant cache hit.
[2023-03-12 09:56:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:31] [INFO ] Implicit Places using invariants and state equation in 2848 ms returned []
Implicit Place search using SMT with State Equation took 3232 ms to find 0 implicit places.
[2023-03-12 09:56:31] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:31] [INFO ] Invariant cache hit.
[2023-03-12 09:56:32] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4400 ms. Remains : 100/100 places, 2225/2225 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244711 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244711 steps, saw 70196 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:56:36] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:36] [INFO ] Invariant cache hit.
[2023-03-12 09:56:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:56:36] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-12 09:56:36] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:36] [INFO ] After 80ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:36] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-12 09:56:36] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 230 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 100/100 places, 2225/2225 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278974 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278974 steps, saw 79567 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 09:56:40] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:40] [INFO ] Invariant cache hit.
[2023-03-12 09:56:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 09:56:40] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:40] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:40] [INFO ] After 79ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:40] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-12 09:56:41] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 247 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 249 ms. Remains : 100/100 places, 2225/2225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 222 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:56:41] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:41] [INFO ] Invariant cache hit.
[2023-03-12 09:56:41] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-12 09:56:41] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:41] [INFO ] Invariant cache hit.
[2023-03-12 09:56:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:43] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
[2023-03-12 09:56:43] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-12 09:56:43] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:43] [INFO ] Invariant cache hit.
[2023-03-12 09:56:45] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3853 ms. Remains : 100/100 places, 2225/2225 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 100 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 100 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 98 transition count 285
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1943 place count 98 transition count 285
Applied a total of 1943 rules in 36 ms. Remains 98 /100 variables (removed 2) and now considering 285/2225 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 98 cols
[2023-03-12 09:56:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 09:56:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:45] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 09:56:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 09:56:45] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 09:56:45] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:56:45] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 09:56:45] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 800 reset in 782 ms.
Product exploration explored 100000 steps with 800 reset in 943 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 234 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:56:48] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-12 09:56:48] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
// Phase 1: matrix 287 rows 100 cols
[2023-03-12 09:56:48] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 09:56:49] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1129 ms. Remains : 100/100 places, 2225/2225 transitions.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 2225/2225 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 2225/2225 (removed 0) transitions.
[2023-03-12 09:56:49] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:49] [INFO ] Invariant cache hit.
[2023-03-12 09:56:49] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-12 09:56:49] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:49] [INFO ] Invariant cache hit.
[2023-03-12 09:56:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 09:56:54] [INFO ] Implicit Places using invariants and state equation in 5311 ms returned []
Implicit Place search using SMT with State Equation took 5568 ms to find 0 implicit places.
[2023-03-12 09:56:54] [INFO ] Flow matrix only has 287 transitions (discarded 1938 similar events)
[2023-03-12 09:56:54] [INFO ] Invariant cache hit.
[2023-03-12 09:56:55] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6351 ms. Remains : 100/100 places, 2225/2225 transitions.
Treatment of property BridgeAndVehicles-PT-V20P20N50-LTLFireability-15 finished in 43061 ms.
[2023-03-12 09:56:55] [INFO ] Flatten gal took : 124 ms
[2023-03-12 09:56:55] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 09:56:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 2228 transitions and 17188 arcs took 16 ms.
Total runtime 269529 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2876/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2876/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2876/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2876/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2876/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N50-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N50-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N50-LTLFireability-08
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N50-LTLFireability-12
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N50-LTLFireability-15

BK_STOP 1678615019814

--------------------
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-V20P20N50-LTLFireability-02
ltl formula formula --ltl=/tmp/2876/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 106 places, 2228 transitions and 17188 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.560 real 0.130 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2876/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2876/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2876/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2876/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N50-LTLFireability-04
ltl formula formula --ltl=/tmp/2876/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 2228 transitions and 17188 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.500 real 0.110 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2876/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2876/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2876/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2876/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N50-LTLFireability-08
ltl formula formula --ltl=/tmp/2876/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 2228 transitions and 17188 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.480 real 0.080 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2876/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2876/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2876/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2876/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5563bd89c3f4]
1: pnml2lts-mc(+0xa2496) [0x5563bd89c496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fc62de0e140]
3: pnml2lts-mc(+0x405be5) [0x5563bdbffbe5]
4: pnml2lts-mc(+0x16b3f9) [0x5563bd9653f9]
5: pnml2lts-mc(+0x164ac4) [0x5563bd95eac4]
6: pnml2lts-mc(+0x272e0a) [0x5563bda6ce0a]
7: pnml2lts-mc(+0xb61f0) [0x5563bd8b01f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fc62dc614d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fc62dc6167a]
10: pnml2lts-mc(+0xa1581) [0x5563bd89b581]
11: pnml2lts-mc(+0xa1910) [0x5563bd89b910]
12: pnml2lts-mc(+0xa32a2) [0x5563bd89d2a2]
13: pnml2lts-mc(+0xa50f4) [0x5563bd89f0f4]
14: pnml2lts-mc(+0xa516b) [0x5563bd89f16b]
15: pnml2lts-mc(+0x3f34b3) [0x5563bdbed4b3]
16: pnml2lts-mc(+0x7c63d) [0x5563bd87663d]
17: pnml2lts-mc(+0x67d86) [0x5563bd861d86]
18: pnml2lts-mc(+0x60a8a) [0x5563bd85aa8a]
19: pnml2lts-mc(+0x5eb15) [0x5563bd858b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fc62dc49d0a]
21: pnml2lts-mc(+0x6075e) [0x5563bd85a75e]
ltl formula name BridgeAndVehicles-PT-V20P20N50-LTLFireability-12
ltl formula formula --ltl=/tmp/2876/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 106 places, 2228 transitions and 17188 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.510 real 0.090 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2876/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2876/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2876/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2876/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-PT-V20P20N50-LTLFireability-15
ltl formula formula --ltl=/tmp/2876/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 2228 transitions and 17188 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.130 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2876/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2876/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2876/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2876/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-V20P20N50"
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-V20P20N50, 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-167813694400220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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