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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 22K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 210K Feb 25 12:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 818K Feb 25 12:19 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 18K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 108K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 319K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 314K Feb 25 12:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 12:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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-V50P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678616379369

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-V50P20N20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:19:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:19:41] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-12 10:19:41] [INFO ] Transformed 138 places.
[2023-03-12 10:19:41] [INFO ] Transformed 2348 transitions.
[2023-03-12 10:19:41] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 135 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 39 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:19:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 10:19:41] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-12 10:19:42] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
[2023-03-12 10:19:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:19:42] [INFO ] Invariant cache hit.
[2023-03-12 10:19:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 10:19:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:19:42] [INFO ] Invariant cache hit.
[2023-03-12 10:19:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:43] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-12 10:19:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:19:43] [INFO ] Invariant cache hit.
[2023-03-12 10:19:43] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1973 ms. Remains : 136/138 places, 2348/2348 transitions.
Support contains 135 out of 136 places after structural reductions.
[2023-03-12 10:19:44] [INFO ] Flatten gal took : 187 ms
[2023-03-12 10:19:44] [INFO ] Flatten gal took : 144 ms
[2023-03-12 10:19:45] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 10:19:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:19:46] [INFO ] Invariant cache hit.
[2023-03-12 10:19:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:19:46] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 10:19:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:19:47] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 10:19:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:19:47] [INFO ] After 191ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 10:19:47] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 9264 ms.
[2023-03-12 10:19:56] [INFO ] After 10083ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 10 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2344
Applied a total of 9 rules in 562 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 131/136 places, 2344/2348 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 159653 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159653 steps, saw 53128 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 10:20:01] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-12 10:20:01] [INFO ] Computed 4 place invariants in 13 ms
[2023-03-12 10:20:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:20:01] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:20:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:20:01] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:20:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:02] [INFO ] After 234ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:20:02] [INFO ] After 786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 575 ms.
[2023-03-12 10:20:03] [INFO ] After 1578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2344/2344 transitions.
Applied a total of 0 rules in 476 ms. Remains 131 /131 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 477 ms. Remains : 131/131 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2344/2344 transitions.
Applied a total of 0 rules in 416 ms. Remains 131 /131 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:20:04] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:20:04] [INFO ] Invariant cache hit.
[2023-03-12 10:20:04] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 10:20:04] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:20:04] [INFO ] Invariant cache hit.
[2023-03-12 10:20:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:05] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1392 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/131 places, 2344/2344 transitions.
Applied a total of 0 rules in 226 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2035 ms. Remains : 129/131 places, 2344/2344 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 172077 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172077 steps, saw 57076 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 10:20:09] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 129 cols
[2023-03-12 10:20:09] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-12 10:20:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:20:09] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:20:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:20:09] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:20:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:09] [INFO ] After 170ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:20:10] [INFO ] After 685ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 491 ms.
[2023-03-12 10:20:10] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 10 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 224 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 129/129 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 203 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:20:11] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:20:11] [INFO ] Invariant cache hit.
[2023-03-12 10:20:11] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 10:20:11] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:20:11] [INFO ] Invariant cache hit.
[2023-03-12 10:20:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:12] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2023-03-12 10:20:12] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-12 10:20:12] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:20:12] [INFO ] Invariant cache hit.
[2023-03-12 10:20:13] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2162 ms. Remains : 129/129 places, 2344/2344 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 129 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 129 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2062 place count 127 transition count 284
Applied a total of 2062 rules in 11 ms. Remains 127 /129 variables (removed 2) and now considering 284/2344 (removed 2060) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 284 rows 127 cols
[2023-03-12 10:20:13] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 10:20:13] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:20:13] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 10:20:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:20:13] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:20:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:20:13] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 10:20:13] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-12 10:20:13] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(!G(!p0)) U p1))'
Support contains 125 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 19 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:20:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:20:14] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 10:20:14] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2023-03-12 10:20:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:14] [INFO ] Invariant cache hit.
[2023-03-12 10:20:14] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-12 10:20:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:14] [INFO ] Invariant cache hit.
[2023-03-12 10:20:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:15] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1286 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 302 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s33 1) (GEQ s55 1) (GEQ s56 1) (GEQ s116 1)) (AND (GEQ s37 1) (GEQ s55 1) (GEQ s56 1) (GEQ s128 1)) (AND (GEQ s38 1) (GEQ s55 1) (GEQ s56...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 794 steps with 1 reset in 104 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 finished in 1791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&((X(G(!p3))||p2) U X(p4))))'
Support contains 129 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 16 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:20:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:15] [INFO ] Invariant cache hit.
[2023-03-12 10:20:16] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2023-03-12 10:20:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:16] [INFO ] Invariant cache hit.
[2023-03-12 10:20:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-12 10:20:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:16] [INFO ] Invariant cache hit.
[2023-03-12 10:20:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:17] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-12 10:20:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:17] [INFO ] Invariant cache hit.
[2023-03-12 10:20:18] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2347/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2201 ms. Remains : 135/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p1), (AND p3 (NOT p4)), (NOT p4), true, p3]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=4 dest: 3}, { cond=(NOT p4), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 5}, { cond=(NOT p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s54 1) (GEQ s56 1) (GEQ s65 1) (GEQ s108 1)) (AND (GEQ s54 1) (GEQ s56 1) (GEQ s104 1) (GEQ s108 1)) (AND (GEQ s54 1) (GEQ s56 1) (GEQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 438 steps with 6 reset in 47 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-03 finished in 2685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((G(F(!p2))&&p1)))))'
Support contains 58 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 22 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:20:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:18] [INFO ] Invariant cache hit.
[2023-03-12 10:20:19] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
[2023-03-12 10:20:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:19] [INFO ] Invariant cache hit.
[2023-03-12 10:20:19] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-12 10:20:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:19] [INFO ] Invariant cache hit.
[2023-03-12 10:20:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:20] [INFO ] Implicit Places using invariants and state equation in 803 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1031 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 23 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2048 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), p2, p2, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s54 20) (GEQ s111 1)) (AND (GEQ s54 20) (GEQ s110 1))), p2:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ...], 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 1456 reset in 797 ms.
Product exploration explored 100000 steps with 1386 reset in 733 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 166 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 10:20:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 10:20:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:20:23] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:24] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-12 10:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:20:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:24] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-12 10:20:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:25] [INFO ] [Nat]Added 42 Read/Feed constraints in 547 ms returned sat
[2023-03-12 10:20:25] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2023-03-12 10:20:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 825 ms
[2023-03-12 10:20:26] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 129 ms.
[2023-03-12 10:20:26] [INFO ] Added : 49 causal constraints over 11 iterations in 479 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 55 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:20:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:26] [INFO ] Invariant cache hit.
[2023-03-12 10:20:27] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
[2023-03-12 10:20:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:27] [INFO ] Invariant cache hit.
[2023-03-12 10:20:27] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-12 10:20:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:27] [INFO ] Invariant cache hit.
[2023-03-12 10:20:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:28] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2023-03-12 10:20:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:28] [INFO ] Invariant cache hit.
[2023-03-12 10:20:29] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2675 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 165 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 10:20:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:30] [INFO ] Invariant cache hit.
[2023-03-12 10:20:30] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:30] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-12 10:20:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:20:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:31] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-12 10:20:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 200 ms returned sat
[2023-03-12 10:20:31] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 0 ms to minimize.
[2023-03-12 10:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1323 ms
[2023-03-12 10:20:32] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 83 ms.
[2023-03-12 10:20:33] [INFO ] Added : 34 causal constraints over 9 iterations in 462 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Product exploration explored 100000 steps with 1352 reset in 640 ms.
Product exploration explored 100000 steps with 1411 reset in 664 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 659 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:20:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:35] [INFO ] Invariant cache hit.
[2023-03-12 10:20:36] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
[2023-03-12 10:20:36] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-12 10:20:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:36] [INFO ] Invariant cache hit.
[2023-03-12 10:20:37] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2410 ms. Remains : 134/134 places, 2347/2347 transitions.
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:20:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:37] [INFO ] Invariant cache hit.
[2023-03-12 10:20:38] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
[2023-03-12 10:20:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:38] [INFO ] Invariant cache hit.
[2023-03-12 10:20:38] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-12 10:20:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:38] [INFO ] Invariant cache hit.
[2023-03-12 10:20:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:39] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2023-03-12 10:20:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:39] [INFO ] Invariant cache hit.
[2023-03-12 10:20:39] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2519 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-04 finished in 21601 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((!p0||(!p1 U (p2||G(!p1)))))))))'
Support contains 75 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 318 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:20:40] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:20:40] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:20:41] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
[2023-03-12 10:20:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:41] [INFO ] Invariant cache hit.
[2023-03-12 10:20:41] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-12 10:20:41] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:41] [INFO ] Invariant cache hit.
[2023-03-12 10:20:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:41] [INFO ] Implicit Places using invariants and state equation in 566 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 732 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 304 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2059 ms. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s106 1) (GEQ s114 1)) (AND (GEQ s107 1) (GEQ s127 1)) (AND (GEQ s106 1) (GEQ s113 1)) (AND (GEQ s107 1) (GEQ s126 1)) (AND (GEQ s106 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 643 reset in 1232 ms.
Product exploration explored 100000 steps with 635 reset in 1222 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X p0), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (OR (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 7 factoid took 654 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Finished random walk after 196 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X p0), (X (OR (NOT p0) p2 (NOT p1))), (X (NOT (OR (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 829 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2))]
[2023-03-12 10:20:46] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2023-03-12 10:20:47] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:20:48] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:48] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-12 10:20:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:20:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:49] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-12 10:20:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 552 ms returned sat
[2023-03-12 10:20:50] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 109 ms.
[2023-03-12 10:20:50] [INFO ] Added : 21 causal constraints over 6 iterations in 405 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 75 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 549 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:20:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:51] [INFO ] Invariant cache hit.
[2023-03-12 10:20:51] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
[2023-03-12 10:20:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:51] [INFO ] Invariant cache hit.
[2023-03-12 10:20:51] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-12 10:20:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:51] [INFO ] Invariant cache hit.
[2023-03-12 10:20:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:52] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2023-03-12 10:20:52] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-12 10:20:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:53] [INFO ] Invariant cache hit.
[2023-03-12 10:20:53] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3299 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p0) (NOT p1) p2)), (X (NOT (OR (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 747 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Finished random walk after 141 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (NOT p0) (NOT p1) p2)), (X (NOT (OR (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X p0), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) (NOT p2) p1)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p2) p1))), (F (OR (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 6 factoid took 764 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
[2023-03-12 10:20:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:20:56] [INFO ] Invariant cache hit.
[2023-03-12 10:20:57] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:57] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-12 10:20:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:20:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:20:58] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-12 10:20:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:20:59] [INFO ] [Nat]Added 42 Read/Feed constraints in 386 ms returned sat
[2023-03-12 10:20:59] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 86 ms.
[2023-03-12 10:20:59] [INFO ] Added : 17 causal constraints over 4 iterations in 325 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 656 reset in 1468 ms.
Product exploration explored 100000 steps with 631 reset in 1161 ms.
Support contains 75 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 369 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:21:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:02] [INFO ] Invariant cache hit.
[2023-03-12 10:21:03] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
[2023-03-12 10:21:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:03] [INFO ] Invariant cache hit.
[2023-03-12 10:21:03] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 10:21:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:03] [INFO ] Invariant cache hit.
[2023-03-12 10:21:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:04] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-12 10:21:04] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-12 10:21:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:04] [INFO ] Invariant cache hit.
[2023-03-12 10:21:05] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2840 ms. Remains : 133/133 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-07 finished in 25058 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 9 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 17 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:21:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:21:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:21:05] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2023-03-12 10:21:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:05] [INFO ] Invariant cache hit.
[2023-03-12 10:21:06] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-12 10:21:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:06] [INFO ] Invariant cache hit.
[2023-03-12 10:21:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:07] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
[2023-03-12 10:21:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:07] [INFO ] Invariant cache hit.
[2023-03-12 10:21:07] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2347/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2576 ms. Remains : 135/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-09 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:(AND (OR (LT s10 1) (LT s52 1) (LT s54 1) (LT s55 1)) (OR (LT s54 1) (LT s56 1) (LT s70 1) (LT s108 1) (AND (GEQ s110 1) (GEQ s117 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 105 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-09 finished in 2680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
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 133 transition count 2346
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 132 transition count 2345
Applied a total of 7 rules in 236 ms. Remains 132 /136 variables (removed 4) and now considering 2345/2348 (removed 3) transitions.
[2023-03-12 10:21:08] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
// Phase 1: matrix 287 rows 132 cols
[2023-03-12 10:21:08] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 10:21:08] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-12 10:21:08] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:08] [INFO ] Invariant cache hit.
[2023-03-12 10:21:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:09] [INFO ] Implicit Places using invariants and state equation in 962 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1289 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/136 places, 2345/2348 transitions.
Applied a total of 0 rules in 228 ms. Remains 130 /130 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1755 ms. Remains : 130/136 places, 2345/2348 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s106 1) (GEQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 588 reset in 642 ms.
Product exploration explored 100000 steps with 600 reset in 524 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Finished random walk after 182 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-12 10:21:11] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
// Phase 1: matrix 287 rows 130 cols
[2023-03-12 10:21:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 10:21:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:21:12] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-12 10:21:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:21:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:21:12] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-12 10:21:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 193 ms returned sat
[2023-03-12 10:21:13] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 164 transitions) in 76 ms.
[2023-03-12 10:21:13] [INFO ] Added : 24 causal constraints over 6 iterations in 312 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 2345/2345 transitions.
Applied a total of 0 rules in 195 ms. Remains 130 /130 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
[2023-03-12 10:21:13] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:13] [INFO ] Invariant cache hit.
[2023-03-12 10:21:13] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-12 10:21:13] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:13] [INFO ] Invariant cache hit.
[2023-03-12 10:21:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:14] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2023-03-12 10:21:15] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-12 10:21:15] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:15] [INFO ] Invariant cache hit.
[2023-03-12 10:21:15] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2527 ms. Remains : 130/130 places, 2345/2345 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 182 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
[2023-03-12 10:21:16] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:16] [INFO ] Invariant cache hit.
[2023-03-12 10:21:16] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:21:17] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-12 10:21:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:21:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:21:17] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-12 10:21:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 1386 ms returned sat
[2023-03-12 10:21:19] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 164 transitions) in 78 ms.
[2023-03-12 10:21:19] [INFO ] Added : 24 causal constraints over 5 iterations in 282 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0)]
Product exploration explored 100000 steps with 597 reset in 525 ms.
Product exploration explored 100000 steps with 591 reset in 518 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 2345/2345 transitions.
Applied a total of 0 rules in 183 ms. Remains 130 /130 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
[2023-03-12 10:21:20] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:20] [INFO ] Invariant cache hit.
[2023-03-12 10:21:21] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-12 10:21:21] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:21] [INFO ] Invariant cache hit.
[2023-03-12 10:21:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:22] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2023-03-12 10:21:22] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 10:21:22] [INFO ] Flow matrix only has 287 transitions (discarded 2058 similar events)
[2023-03-12 10:21:22] [INFO ] Invariant cache hit.
[2023-03-12 10:21:23] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2503 ms. Remains : 130/130 places, 2345/2345 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-10 finished in 15307 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 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
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 133 transition count 2346
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 131 transition count 2344
Applied a total of 9 rules in 280 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
[2023-03-12 10:21:23] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-12 10:21:23] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 10:21:23] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 10:21:23] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:23] [INFO ] Invariant cache hit.
[2023-03-12 10:21:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:24] [INFO ] Implicit Places using invariants and state equation in 836 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1239 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 2344/2348 transitions.
Applied a total of 0 rules in 245 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1768 ms. Remains : 129/136 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s52 1) (LT s64 1) (LT s127 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 323 reset in 907 ms.
Product exploration explored 100000 steps with 324 reset in 750 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 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 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245646 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245646 steps, saw 78500 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:21:30] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 129 cols
[2023-03-12 10:21:30] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 10:21:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:21:30] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:21:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:21:30] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:30] [INFO ] After 43ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:30] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 10:21:30] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 181 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 129/129 places, 2344/2344 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308440 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308440 steps, saw 96450 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:21:33] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:33] [INFO ] Invariant cache hit.
[2023-03-12 10:21:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:34] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:21:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:34] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:34] [INFO ] After 40ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:34] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-12 10:21:34] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 209 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 129/129 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 234 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:21:34] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:34] [INFO ] Invariant cache hit.
[2023-03-12 10:21:35] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-12 10:21:35] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:35] [INFO ] Invariant cache hit.
[2023-03-12 10:21:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:35] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2023-03-12 10:21:35] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 10:21:35] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:35] [INFO ] Invariant cache hit.
[2023-03-12 10:21:36] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2167 ms. Remains : 129/129 places, 2344/2344 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 129 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 129 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2062 place count 127 transition count 284
Applied a total of 2062 rules in 8 ms. Remains 127 /129 variables (removed 2) and now considering 284/2344 (removed 2060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 127 cols
[2023-03-12 10:21:36] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 10:21:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:21:36] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:21:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 10:21:36] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:21:36] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:36] [INFO ] After 45ms 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 10:21:37] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 207 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:21:37] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 129 cols
[2023-03-12 10:21:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 10:21:37] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-12 10:21:37] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:37] [INFO ] Invariant cache hit.
[2023-03-12 10:21:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:38] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-12 10:21:38] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 10:21:38] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:38] [INFO ] Invariant cache hit.
[2023-03-12 10:21:39] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1942 ms. Remains : 129/129 places, 2344/2344 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 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 22 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 329466 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329466 steps, saw 102601 distinct states, run finished after 3002 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:21:42] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:42] [INFO ] Invariant cache hit.
[2023-03-12 10:21:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:42] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:21:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:42] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:42] [INFO ] After 39ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:42] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 10:21:42] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 219 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 129/129 places, 2344/2344 transitions.
Incomplete random walk after 10000 steps, including 32 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 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311086 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311086 steps, saw 97296 distinct states, run finished after 3003 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 10:21:46] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:46] [INFO ] Invariant cache hit.
[2023-03-12 10:21:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:46] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:21:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:46] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:46] [INFO ] After 62ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:46] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 10:21:46] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 203 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 129/129 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 212 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:21:47] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:47] [INFO ] Invariant cache hit.
[2023-03-12 10:21:47] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-12 10:21:47] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:47] [INFO ] Invariant cache hit.
[2023-03-12 10:21:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:48] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2023-03-12 10:21:48] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-12 10:21:48] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:48] [INFO ] Invariant cache hit.
[2023-03-12 10:21:49] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2192 ms. Remains : 129/129 places, 2344/2344 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 129 transition count 286
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 129 transition count 284
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2062 place count 127 transition count 284
Applied a total of 2062 rules in 7 ms. Remains 127 /129 variables (removed 2) and now considering 284/2344 (removed 2060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 127 cols
[2023-03-12 10:21:49] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 10:21:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:49] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 10:21:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 10:21:49] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 10:21:49] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 10:21:49] [INFO ] After 36ms 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 10:21:49] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 324 reset in 630 ms.
Product exploration explored 100000 steps with 324 reset in 650 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 214 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2023-03-12 10:21:51] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 129 cols
[2023-03-12 10:21:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-12 10:21:51] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-12 10:21:51] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:51] [INFO ] Invariant cache hit.
[2023-03-12 10:21:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:52] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-12 10:21:52] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 10:21:52] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:52] [INFO ] Invariant cache hit.
[2023-03-12 10:21:52] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1967 ms. Remains : 129/129 places, 2344/2344 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-12 finished in 29826 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)||F(G(p1))))'
Support contains 7 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 192 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2023-03-12 10:21:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2023-03-12 10:21:53] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 10:21:54] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
[2023-03-12 10:21:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:21:54] [INFO ] Invariant cache hit.
[2023-03-12 10:21:54] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-12 10:21:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2023-03-12 10:21:54] [INFO ] Invariant cache hit.
[2023-03-12 10:21:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:55] [INFO ] Implicit Places using invariants and state equation in 996 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1265 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 225 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2484 ms. Remains : 135/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s92 1) (GEQ s113 1) (OR (LT s53 1) (LT s55 1) (LT s79 1) (LT s107 1))), p1:(GEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 7 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-13 finished in 2594 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 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
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 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2344
Applied a total of 9 rules in 257 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
[2023-03-12 10:21:55] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2023-03-12 10:21:55] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 10:21:56] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-12 10:21:56] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2023-03-12 10:21:56] [INFO ] Invariant cache hit.
[2023-03-12 10:21:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:57] [INFO ] Implicit Places using invariants and state equation in 850 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 2344/2348 transitions.
Applied a total of 0 rules in 203 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1614 ms. Remains : 129/136 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-14 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 (GEQ s1 1) (GEQ s52 1) (GEQ s66 1) (GEQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-14 finished in 1683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !p1) U (p2||X(F(p1)))))'
Support contains 10 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 25 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:21:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:21:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:21:58] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
[2023-03-12 10:21:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:58] [INFO ] Invariant cache hit.
[2023-03-12 10:21:58] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-12 10:21:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:21:58] [INFO ] Invariant cache hit.
[2023-03-12 10:21:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:21:59] [INFO ] Implicit Places using invariants and state equation in 798 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1024 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1824 ms. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s56 1) (GEQ s57 1) (GEQ s130 1)), p1:(AND (GEQ s27 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)), p0:(AND (GEQ s22 1) (GEQ s56 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 441 reset in 673 ms.
Product exploration explored 100000 steps with 443 reset in 561 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 325 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 134 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p2) (NOT p1))]
[2023-03-12 10:22:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 10:22:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:01] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-12 10:22:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:22:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:22:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:02] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-12 10:22:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 173 ms returned sat
[2023-03-12 10:22:02] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 82 ms.
[2023-03-12 10:22:02] [INFO ] Added : 27 causal constraints over 6 iterations in 247 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 8 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 236 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:02] [INFO ] Invariant cache hit.
[2023-03-12 10:22:03] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
[2023-03-12 10:22:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:03] [INFO ] Invariant cache hit.
[2023-03-12 10:22:03] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 10:22:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:03] [INFO ] Invariant cache hit.
[2023-03-12 10:22:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:04] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2023-03-12 10:22:04] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-12 10:22:04] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:04] [INFO ] Invariant cache hit.
[2023-03-12 10:22:05] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2706 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p2))]
Finished random walk after 315 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=105 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p1) (NOT p2))]
[2023-03-12 10:22:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:05] [INFO ] Invariant cache hit.
[2023-03-12 10:22:05] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:06] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-12 10:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:22:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:06] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-12 10:22:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 484 ms returned sat
[2023-03-12 10:22:06] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2023-03-12 10:22:07] [INFO ] Added : 89 causal constraints over 18 iterations in 992 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 442 reset in 685 ms.
Product exploration explored 100000 steps with 441 reset in 647 ms.
Support contains 8 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 269 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:09] [INFO ] Invariant cache hit.
[2023-03-12 10:22:10] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
[2023-03-12 10:22:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:10] [INFO ] Invariant cache hit.
[2023-03-12 10:22:10] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-12 10:22:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:10] [INFO ] Invariant cache hit.
[2023-03-12 10:22:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:11] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2023-03-12 10:22:11] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 10:22:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:11] [INFO ] Invariant cache hit.
[2023-03-12 10:22:12] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2771 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-15 finished in 14843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((G(F(!p2))&&p1)))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-04
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), p2, p2, (NOT p1)]
Support contains 58 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 30 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:22:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:22:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:22:13] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2023-03-12 10:22:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:13] [INFO ] Invariant cache hit.
[2023-03-12 10:22:13] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-12 10:22:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:13] [INFO ] Invariant cache hit.
[2023-03-12 10:22:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:14] [INFO ] Implicit Places using invariants and state equation in 633 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 879 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 23 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1534 ms. Remains : 134/136 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s54 20) (GEQ s111 1)) (AND (GEQ s54 20) (GEQ s110 1))), p2:(OR (AND (GEQ s7 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)) (AND (GEQ s26 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1386 reset in 666 ms.
Product exploration explored 100000 steps with 1366 reset in 548 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 306 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 154 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=51 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X p1), (X (NOT p0)), true, (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 7 factoid took 302 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 10:22:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 10:22:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:22:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:16] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-12 10:22:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:22:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:17] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-12 10:22:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 460 ms returned sat
[2023-03-12 10:22:18] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2023-03-12 10:22:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 815 ms
[2023-03-12 10:22:18] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 82 ms.
[2023-03-12 10:22:19] [INFO ] Added : 49 causal constraints over 11 iterations in 362 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 55 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 9 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:19] [INFO ] Invariant cache hit.
[2023-03-12 10:22:19] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2023-03-12 10:22:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:19] [INFO ] Invariant cache hit.
[2023-03-12 10:22:20] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-12 10:22:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:20] [INFO ] Invariant cache hit.
[2023-03-12 10:22:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:20] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-03-12 10:22:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:20] [INFO ] Invariant cache hit.
[2023-03-12 10:22:21] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2327 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Finished random walk after 163 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F p0), (F p2)]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
[2023-03-12 10:22:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:22] [INFO ] Invariant cache hit.
[2023-03-12 10:22:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:22] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-12 10:22:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:22:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:23] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-12 10:22:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 270 ms returned sat
[2023-03-12 10:22:23] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 0 ms to minimize.
[2023-03-12 10:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1339 ms
[2023-03-12 10:22:24] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 86 ms.
[2023-03-12 10:22:25] [INFO ] Added : 34 causal constraints over 9 iterations in 280 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Product exploration explored 100000 steps with 1421 reset in 692 ms.
Product exploration explored 100000 steps with 1398 reset in 548 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 298 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:27] [INFO ] Invariant cache hit.
[2023-03-12 10:22:27] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
[2023-03-12 10:22:27] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-12 10:22:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:27] [INFO ] Invariant cache hit.
[2023-03-12 10:22:28] [INFO ] Dead Transitions using invariants and state equation in 755 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1945 ms. Remains : 134/134 places, 2347/2347 transitions.
Support contains 55 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 7 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:28] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:28] [INFO ] Invariant cache hit.
[2023-03-12 10:22:29] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2023-03-12 10:22:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:29] [INFO ] Invariant cache hit.
[2023-03-12 10:22:29] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-12 10:22:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:29] [INFO ] Invariant cache hit.
[2023-03-12 10:22:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:30] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-12 10:22:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:30] [INFO ] Invariant cache hit.
[2023-03-12 10:22:30] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2179 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-04 finished in 18886 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((!p0||(!p1 U (p2||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' '!(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) U !p1) U (p2||X(F(p1)))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-15
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 10 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 30 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2023-03-12 10:22:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2023-03-12 10:22:31] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:22:32] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2023-03-12 10:22:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:32] [INFO ] Invariant cache hit.
[2023-03-12 10:22:32] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 10:22:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:32] [INFO ] Invariant cache hit.
[2023-03-12 10:22:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:33] [INFO ] Implicit Places using invariants and state equation in 831 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1063 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1853 ms. Remains : 134/136 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s56 1) (GEQ s57 1) (GEQ s130 1)), p1:(AND (GEQ s27 1) (GEQ s52 1) (GEQ s54 1) (GEQ s55 1)), p0:(AND (GEQ s22 1) (GEQ s56 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 439 reset in 521 ms.
Product exploration explored 100000 steps with 431 reset in 532 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 243 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p2) (NOT p1))]
[2023-03-12 10:22:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2023-03-12 10:22:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 10:22:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:35] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-12 10:22:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:22:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 10:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:36] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-12 10:22:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 211 ms returned sat
[2023-03-12 10:22:36] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 86 ms.
[2023-03-12 10:22:36] [INFO ] Added : 27 causal constraints over 6 iterations in 223 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p1))
Support contains 8 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 241 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:36] [INFO ] Invariant cache hit.
[2023-03-12 10:22:37] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
[2023-03-12 10:22:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:37] [INFO ] Invariant cache hit.
[2023-03-12 10:22:37] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-12 10:22:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:37] [INFO ] Invariant cache hit.
[2023-03-12 10:22:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:38] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2023-03-12 10:22:38] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 10:22:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:38] [INFO ] Invariant cache hit.
[2023-03-12 10:22:39] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2794 ms. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p2))]
Finished random walk after 244 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p2))]
[2023-03-12 10:22:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:39] [INFO ] Invariant cache hit.
[2023-03-12 10:22:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:40] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-12 10:22:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:22:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:22:40] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-12 10:22:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 484 ms returned sat
[2023-03-12 10:22:41] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 78 ms.
[2023-03-12 10:22:42] [INFO ] Added : 89 causal constraints over 18 iterations in 1263 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 434 reset in 720 ms.
Product exploration explored 100000 steps with 454 reset in 629 ms.
Support contains 8 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 195 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2023-03-12 10:22:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:43] [INFO ] Invariant cache hit.
[2023-03-12 10:22:44] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
[2023-03-12 10:22:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:44] [INFO ] Invariant cache hit.
[2023-03-12 10:22:44] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-12 10:22:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:44] [INFO ] Invariant cache hit.
[2023-03-12 10:22:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 10:22:45] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-12 10:22:45] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 10:22:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2023-03-12 10:22:45] [INFO ] Invariant cache hit.
[2023-03-12 10:22:46] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2570 ms. Remains : 134/134 places, 2347/2347 transitions.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-15 finished in 15004 ms.
[2023-03-12 10:22:46] [INFO ] Flatten gal took : 93 ms
[2023-03-12 10:22:46] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 18 ms.
[2023-03-12 10:22:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 2348 transitions and 18088 arcs took 14 ms.
Total runtime 185143 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2476/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2476/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393340 kB
MemFree: 15314920 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16118948 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2476/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2476/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2476/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLFireability-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLFireability-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLFireability-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-LTLFireability-15

BK_STOP 1678617284695

--------------------
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-V50P20N20-LTLFireability-04
ltl formula formula --ltl=/tmp/2476/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 136 places, 2348 transitions and 18088 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.340 real 0.070 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2476/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2476/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2476/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2476/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLFireability-07
ltl formula formula --ltl=/tmp/2476/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 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.390 real 0.060 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2476/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2476/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2476/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2476/ltl_1_
Killing (15) : 2488 2489 2490 2491 2492
Killing (9) : 2488 2489 2490 2491 2492
ltl formula name BridgeAndVehicles-PT-V50P20N20-LTLFireability-10
ltl formula formula --ltl=/tmp/2476/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 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.570 real 0.120 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2476/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2476/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2476/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2476/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 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-V50P20N20-LTLFireability-12
ltl formula formula --ltl=/tmp/2476/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 136 places, 2348 transitions and 18088 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2476/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.560 real 0.130 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2476/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2476/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2476/ltl_3_
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-V50P20N20-LTLFireability-15
ltl formula formula --ltl=/tmp/2476/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 136 places, 2348 transitions and 18088 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.430 real 0.150 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2476/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2476/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2476/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2476/ltl_4_
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
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P20N20"
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-V50P20N20, 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-167813694400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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