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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 12:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 41K 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-COL-V20P20N50-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678602978964

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-COL-V20P20N50
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:36:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 06:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:36:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 06:36:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 06:36:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 448 ms
[2023-03-12 06:36:21] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 06:36:21] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2023-03-12 06:36:21] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Finished random walk after 47 steps, including 0 resets, run visited all 5 properties in 16 ms. (steps per millisecond=2 )
[2023-03-12 06:36:21] [INFO ] Flatten gal took : 16 ms
[2023-03-12 06:36:21] [INFO ] Flatten gal took : 3 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-12 06:36:21] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 61 ms.
[2023-03-12 06:36:21] [INFO ] Unfolded 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 33 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:36:22] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:36:22] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-12 06:36:23] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
[2023-03-12 06:36:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:23] [INFO ] Invariant cache hit.
[2023-03-12 06:36:23] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-12 06:36:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:23] [INFO ] Invariant cache hit.
[2023-03-12 06:36:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:23] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-12 06:36:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:23] [INFO ] Invariant cache hit.
[2023-03-12 06:36:24] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2228/2228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2390 ms. Remains : 106/108 places, 2228/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2023-03-12 06:36:25] [INFO ] Flatten gal took : 231 ms
[2023-03-12 06:36:26] [INFO ] Flatten gal took : 238 ms
[2023-03-12 06:36:27] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:36:28] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:28] [INFO ] Invariant cache hit.
[2023-03-12 06:36:28] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2023-03-12 06:36:28] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:36:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-12 06:36:28] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:28] [INFO ] After 85ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:29] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 06:36:29] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Applied a total of 5 rules in 878 ms. Remains 103 /106 variables (removed 3) and now considering 2226/2228 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 879 ms. Remains : 103/106 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 300692 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 300692 steps, saw 85363 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:36:33] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2023-03-12 06:36:33] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-12 06:36:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:36:33] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:36:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:36:33] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:33] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:33] [INFO ] After 99ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:33] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-12 06:36:33] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 288 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 103/103 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 526 ms. Remains 103 /103 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 06:36:34] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:36:34] [INFO ] Invariant cache hit.
[2023-03-12 06:36:35] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-12 06:36:35] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:36:35] [INFO ] Invariant cache hit.
[2023-03-12 06:36:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:36] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1678 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 101/103 places, 2226/2226 transitions.
Applied a total of 0 rules in 260 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2464 ms. Remains : 101/103 places, 2226/2226 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334715 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334715 steps, saw 95280 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:36:39] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2023-03-12 06:36:39] [INFO ] Computed 4 place invariants in 16 ms
[2023-03-12 06:36:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-12 06:36:39] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:36:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:36:40] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:40] [INFO ] After 135ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:40] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-12 06:36:40] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 242 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 101/101 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 212 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-12 06:36:40] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:36:40] [INFO ] Invariant cache hit.
[2023-03-12 06:36:41] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-12 06:36:41] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:36:41] [INFO ] Invariant cache hit.
[2023-03-12 06:36:41] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:42] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2023-03-12 06:36:42] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-12 06:36:42] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
[2023-03-12 06:36:42] [INFO ] Invariant cache hit.
[2023-03-12 06:36:43] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2600 ms. Remains : 101/101 places, 2226/2226 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 101 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1940 place count 101 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1942 place count 99 transition count 286
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1944 place count 99 transition count 286
Applied a total of 1944 rules in 18 ms. Remains 99 /101 variables (removed 2) and now considering 286/2226 (removed 1940) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 99 cols
[2023-03-12 06:36:43] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-12 06:36:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:36:43] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:36:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 06:36:43] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 06:36:43] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:36:43] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 06:36:43] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 49 stabilizing places and 84 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(!p1)))'
Support contains 74 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:36:44] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:36:44] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:36:45] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
[2023-03-12 06:36:45] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:45] [INFO ] Invariant cache hit.
[2023-03-12 06:36:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-12 06:36:45] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:36:45] [INFO ] Invariant cache hit.
[2023-03-12 06:36:45] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:46] [INFO ] Implicit Places using invariants and state equation in 582 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 713 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1497 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), false, false, p1]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s48 1) (GEQ s87 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s48 1) (GEQ s99 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s48 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 268 steps with 1 reset in 54 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-00 finished in 1930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 14 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:36:46] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:36:46] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:36:47] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2023-03-12 06:36:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:47] [INFO ] Invariant cache hit.
[2023-03-12 06:36:47] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-12 06:36:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:47] [INFO ] Invariant cache hit.
[2023-03-12 06:36:47] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:47] [INFO ] Implicit Places using invariants and state equation in 603 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 729 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1493 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s40 1) (GEQ s46 1) (GEQ s54 1)) (AND (GEQ s1 1) (GEQ s25 1) (GEQ s46 1) (GEQ s73 1)) (AND (GEQ s1 1) (GEQ s36 1) (GEQ s46 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-01 finished in 1610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 23 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 604 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:36:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:48] [INFO ] Invariant cache hit.
[2023-03-12 06:36:49] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
[2023-03-12 06:36:49] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:49] [INFO ] Invariant cache hit.
[2023-03-12 06:36:49] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-12 06:36:49] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:49] [INFO ] Invariant cache hit.
[2023-03-12 06:36:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:50] [INFO ] Implicit Places using invariants and state equation in 842 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1112 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 216 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2715 ms. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s28 1) (GEQ s45 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s35 1) (GEQ s45 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s40 1) (GEQ s45 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1292 reset in 874 ms.
Product exploration explored 100000 steps with 1281 reset in 981 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2023-03-12 06:36:53] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-12 06:36:53] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:36:54] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:36:54] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-12 06:36:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:36:55] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-12 06:36:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:55] [INFO ] [Nat]Added 102 Read/Feed constraints in 42 ms returned sat
[2023-03-12 06:36:55] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 220 ms.
[2023-03-12 06:36:55] [INFO ] Added : 64 causal constraints over 15 iterations in 584 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 265 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:36:56] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:56] [INFO ] Invariant cache hit.
[2023-03-12 06:36:56] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
[2023-03-12 06:36:56] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:56] [INFO ] Invariant cache hit.
[2023-03-12 06:36:57] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-12 06:36:57] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:57] [INFO ] Invariant cache hit.
[2023-03-12 06:36:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:36:57] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2023-03-12 06:36:58] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 06:36:58] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:58] [INFO ] Invariant cache hit.
[2023-03-12 06:36:58] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2906 ms. Remains : 104/104 places, 2227/2227 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 108 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
[2023-03-12 06:36:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:36:59] [INFO ] Invariant cache hit.
[2023-03-12 06:37:00] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:37:00] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-12 06:37:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:37:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 06:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:37:01] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-12 06:37:01] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:01] [INFO ] [Nat]Added 102 Read/Feed constraints in 74 ms returned sat
[2023-03-12 06:37:01] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 119 ms.
[2023-03-12 06:37:01] [INFO ] Added : 65 causal constraints over 13 iterations in 462 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1287 reset in 897 ms.
Product exploration explored 100000 steps with 1267 reset in 786 ms.
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 239 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:37:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:03] [INFO ] Invariant cache hit.
[2023-03-12 06:37:04] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
[2023-03-12 06:37:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:04] [INFO ] Invariant cache hit.
[2023-03-12 06:37:04] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-12 06:37:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:04] [INFO ] Invariant cache hit.
[2023-03-12 06:37:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:05] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2023-03-12 06:37:05] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-12 06:37:05] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:05] [INFO ] Invariant cache hit.
[2023-03-12 06:37:06] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2972 ms. Remains : 104/104 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-02 finished in 18861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(!p1))) U (p1&&F(p2)&&X(p0))))'
Support contains 77 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:37:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:37:06] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:37:07] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
[2023-03-12 06:37:07] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:07] [INFO ] Invariant cache hit.
[2023-03-12 06:37:07] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-12 06:37:07] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:07] [INFO ] Invariant cache hit.
[2023-03-12 06:37:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:08] [INFO ] Implicit Places using invariants and state equation in 655 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 779 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1532 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s45 1), p2:(OR (AND (GEQ s0 20) (GEQ s103 1)) (AND (GEQ s0 20) (GEQ s102 1))), p1:(OR (AND (GEQ s1 1) (GEQ s40 1) (GEQ s47 1) (GEQ s55 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-03 finished in 1866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 23 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 229 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:37:08] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:37:08] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 06:37:09] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2023-03-12 06:37:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:09] [INFO ] Invariant cache hit.
[2023-03-12 06:37:10] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-12 06:37:10] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:10] [INFO ] Invariant cache hit.
[2023-03-12 06:37:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:11] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1329 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 214 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2551 ms. Remains : 104/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s17 1) (LT s23 1) (LT s47 1)) (OR (LT s0 1) (LT s11 1) (LT s23 1) (LT s47 1)) (OR (LT s0 1) (LT s5 1) (LT s23 1) (LT s47 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 602 reset in 966 ms.
Product exploration explored 100000 steps with 602 reset in 917 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 167 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 219 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:37:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 104 cols
[2023-03-12 06:37:13] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:37:14] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
[2023-03-12 06:37:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:14] [INFO ] Invariant cache hit.
[2023-03-12 06:37:14] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-12 06:37:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:14] [INFO ] Invariant cache hit.
[2023-03-12 06:37:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:15] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2023-03-12 06:37:15] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-12 06:37:15] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:15] [INFO ] Invariant cache hit.
[2023-03-12 06:37:16] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2854 ms. Remains : 104/104 places, 2227/2227 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 139 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 36 ms :[(NOT p0)]
Finished random walk after 110 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 129 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 602 reset in 906 ms.
Product exploration explored 100000 steps with 602 reset in 976 ms.
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2227/2227 transitions.
Applied a total of 0 rules in 280 ms. Remains 104 /104 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:37:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:19] [INFO ] Invariant cache hit.
[2023-03-12 06:37:20] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
[2023-03-12 06:37:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:20] [INFO ] Invariant cache hit.
[2023-03-12 06:37:20] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-12 06:37:20] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:20] [INFO ] Invariant cache hit.
[2023-03-12 06:37:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:21] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2023-03-12 06:37:21] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 06:37:21] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:21] [INFO ] Invariant cache hit.
[2023-03-12 06:37:22] [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 3377 ms. Remains : 104/104 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-04 finished in 14011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1)) U p2)))'
Support contains 26 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 16 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:37:22] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:37:22] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:37:23] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
[2023-03-12 06:37:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:23] [INFO ] Invariant cache hit.
[2023-03-12 06:37:23] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-12 06:37:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:23] [INFO ] Invariant cache hit.
[2023-03-12 06:37:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:24] [INFO ] Implicit Places using invariants and state equation in 946 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1194 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1949 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s0 20) (GEQ s103 1)) (AND (GEQ s0 20) (GEQ s102 1))), p0:(OR (AND (GEQ s27 1) (GEQ s46 1)) (AND (GEQ s44 1) (GEQ s46 1)) (AND (GEQ s37 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-05 finished in 2250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 14 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:37:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:37:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:37:25] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
[2023-03-12 06:37:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:25] [INFO ] Invariant cache hit.
[2023-03-12 06:37:25] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-12 06:37:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:25] [INFO ] Invariant cache hit.
[2023-03-12 06:37:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:26] [INFO ] Implicit Places using invariants and state equation in 528 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 674 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1382 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s47 1) (GEQ s86 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s47 1) (GEQ s98 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s47 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1779 ms.
Product exploration explored 100000 steps with 33333 reset in 1683 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-07 finished in 5086 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 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:37:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:37:30] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:37:30] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
[2023-03-12 06:37:30] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:30] [INFO ] Invariant cache hit.
[2023-03-12 06:37:31] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-12 06:37:31] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:31] [INFO ] Invariant cache hit.
[2023-03-12 06:37:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:32] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1660 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 12 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2464 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s45 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 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-08 finished in 2603 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 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 266 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:37:32] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:37:32] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-12 06:37:33] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
[2023-03-12 06:37:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:33] [INFO ] Invariant cache hit.
[2023-03-12 06:37:33] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-12 06:37:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:33] [INFO ] Invariant cache hit.
[2023-03-12 06:37:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:35] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1895 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 220 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3104 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s44 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 1525 reset in 871 ms.
Product exploration explored 100000 steps with 1510 reset in 710 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-12 06:37:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:37:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 06:37:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:37:38] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-12 06:37:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:37:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:37:39] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-12 06:37:39] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:40] [INFO ] [Nat]Added 102 Read/Feed constraints in 1595 ms returned sat
[2023-03-12 06:37:41] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 148 ms.
[2023-03-12 06:37:41] [INFO ] Added : 39 causal constraints over 9 iterations in 452 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 216 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:37:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:41] [INFO ] Invariant cache hit.
[2023-03-12 06:37:42] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
[2023-03-12 06:37:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:42] [INFO ] Invariant cache hit.
[2023-03-12 06:37:42] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-12 06:37:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:42] [INFO ] Invariant cache hit.
[2023-03-12 06:37:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:43] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2023-03-12 06:37:43] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-12 06:37:43] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:43] [INFO ] Invariant cache hit.
[2023-03-12 06:37:44] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3310 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 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 29 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 185 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-12 06:37:45] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:45] [INFO ] Invariant cache hit.
[2023-03-12 06:37:45] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 06:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:37:45] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-12 06:37:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:37:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:37:46] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-12 06:37:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:48] [INFO ] [Nat]Added 102 Read/Feed constraints in 1414 ms returned sat
[2023-03-12 06:37:48] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 118 ms.
[2023-03-12 06:37:48] [INFO ] Added : 39 causal constraints over 9 iterations in 369 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1550 reset in 807 ms.
Product exploration explored 100000 steps with 1554 reset in 681 ms.
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 190 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:37:50] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:50] [INFO ] Invariant cache hit.
[2023-03-12 06:37:51] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
[2023-03-12 06:37:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:51] [INFO ] Invariant cache hit.
[2023-03-12 06:37:51] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-12 06:37:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:51] [INFO ] Invariant cache hit.
[2023-03-12 06:37:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:52] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2023-03-12 06:37:52] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-12 06:37:52] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:52] [INFO ] Invariant cache hit.
[2023-03-12 06:37:53] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3345 ms. Remains : 103/103 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-09 finished in 21071 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 73 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 337 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2023-03-12 06:37:54] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2023-03-12 06:37:54] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-12 06:37:54] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-12 06:37:54] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 06:37:54] [INFO ] Invariant cache hit.
[2023-03-12 06:37:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:54] [INFO ] Implicit Places using invariants and state equation in 535 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 705 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 295 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1338 ms. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-10 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 (AND (GEQ s0 1) (GEQ s38 1) (GEQ s44 1) (GEQ s52 1)) (AND (GEQ s0 1) (GEQ s23 1) (GEQ s44 1) (GEQ s71 1)) (AND (GEQ s0 1) (GEQ s34 1) (GEQ s44 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 123 steps with 0 reset in 16 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-10 finished in 1442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 44 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2224
Applied a total of 9 rules in 277 ms. Remains 101 /106 variables (removed 5) and now considering 2224/2228 (removed 4) transitions.
[2023-03-12 06:37:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 06:37:55] [INFO ] Invariant cache hit.
[2023-03-12 06:37:55] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-12 06:37:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2023-03-12 06:37:55] [INFO ] Invariant cache hit.
[2023-03-12 06:37:55] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:56] [INFO ] Implicit Places using invariants and state equation in 881 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1090 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 2224/2228 transitions.
Applied a total of 0 rules in 242 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1616 ms. Remains : 99/106 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s21 1)) (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s19 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s21 1)) (AND (GEQ s6 1) (GEQ s21 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-11 finished in 1834 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((X(X(p0))&&((p1&&X(!p2)) U X(p3)))))'
Support contains 98 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:37:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:37:57] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:37:57] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
[2023-03-12 06:37:57] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:57] [INFO ] Invariant cache hit.
[2023-03-12 06:37:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-12 06:37:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:37:58] [INFO ] Invariant cache hit.
[2023-03-12 06:37:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:37:58] [INFO ] Implicit Places using invariants and state equation in 441 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 589 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1418 ms. Remains : 105/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s24 1), p3:(AND (OR (LT s0 1) (LT s17 1) (LT s23 1) (LT s48 1)) (OR (LT s0 1) (LT s11 1) (LT s23 1) (LT s48 1)) (OR (LT s0 1) (LT s5 1) (LT s23 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-12 finished in 1753 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 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 236 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:37:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:37:59] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:37:59] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
[2023-03-12 06:37:59] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:37:59] [INFO ] Invariant cache hit.
[2023-03-12 06:38:00] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-12 06:38:00] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:38:00] [INFO ] Invariant cache hit.
[2023-03-12 06:38:00] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:01] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1523 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 210 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2772 ms. Remains : 103/106 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s44 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 144 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-13 finished in 2855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0||F(!p1)||(X(!p2) U (X(G(!p2))||(p3&&X(!p2))))))))'
Support contains 29 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 15 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:38:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:38:01] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-12 06:38:02] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
[2023-03-12 06:38:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:02] [INFO ] Invariant cache hit.
[2023-03-12 06:38:02] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-12 06:38:02] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:02] [INFO ] Invariant cache hit.
[2023-03-12 06:38:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:03] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-12 06:38:03] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:03] [INFO ] Invariant cache hit.
[2023-03-12 06:38:04] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2656 ms. Remains : 106/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p3 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 p3 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s29 1) (GEQ s47 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s36 1) (GEQ s47 1) (GEQ s50 1)) (AND (GEQ s0 1) (GEQ s41 1) (GEQ s47 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 602 reset in 1255 ms.
Product exploration explored 100000 steps with 602 reset in 1068 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/106 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1632 ms. Reduced automaton from 4 states, 18 edges and 4 AP (stutter sensitive) to 4 states, 18 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 368063 steps, run timeout after 6001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 368063 steps, saw 94461 distinct states, run finished after 6001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-12 06:38:16] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:16] [INFO ] Invariant cache hit.
[2023-03-12 06:38:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:38:17] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:6
[2023-03-12 06:38:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:38:17] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :2
[2023-03-12 06:38:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:18] [INFO ] After 384ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :9 sat :2
[2023-03-12 06:38:18] [INFO ] After 818ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-12 06:38:18] [INFO ] After 1393ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :2
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 27 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 233 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:38:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:18] [INFO ] Invariant cache hit.
[2023-03-12 06:38:19] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1089 ms. Remains : 106/106 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 255673 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255673 steps, saw 66897 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:38:23] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:23] [INFO ] Invariant cache hit.
[2023-03-12 06:38:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:38:23] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:38:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:38:23] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:38:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:23] [INFO ] After 303ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:38:24] [INFO ] After 599ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-12 06:38:24] [INFO ] After 1287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 27 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 208 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 106/106 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 169 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:38:24] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:24] [INFO ] Invariant cache hit.
[2023-03-12 06:38:25] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-12 06:38:25] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:25] [INFO ] Invariant cache hit.
[2023-03-12 06:38:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:25] [INFO ] Implicit Places using invariants and state equation in 717 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 929 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 195 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1294 ms. Remains : 105/106 places, 2228/2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 254324 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254324 steps, saw 66520 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:38:29] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 105 cols
[2023-03-12 06:38:29] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-12 06:38:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:38:29] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:38:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:38:29] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:38:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:30] [INFO ] After 302ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:38:30] [INFO ] After 661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-12 06:38:30] [INFO ] After 1293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 27 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 254 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 105/105 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2228/2228 transitions.
Applied a total of 0 rules in 244 ms. Remains 105 /105 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:38:31] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:31] [INFO ] Invariant cache hit.
[2023-03-12 06:38:31] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 06:38:31] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:31] [INFO ] Invariant cache hit.
[2023-03-12 06:38:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:32] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2023-03-12 06:38:32] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-12 06:38:32] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:32] [INFO ] Invariant cache hit.
[2023-03-12 06:38:33] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2189 ms. Remains : 105/105 places, 2228/2228 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 105 transition count 290
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1939 place count 105 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1940 place count 104 transition count 289
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1941 place count 104 transition count 289
Applied a total of 1941 rules in 16 ms. Remains 104 /105 variables (removed 1) and now considering 289/2228 (removed 1939) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 289 rows 104 cols
[2023-03-12 06:38:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:38:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:38:33] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:38:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:38:33] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:38:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:38:33] [INFO ] After 130ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:38:33] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-12 06:38:34] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 9 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (AND p0 p1 p3 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND p0 p1 p3 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p1 (NOT p3) p0))), (G (NOT (AND p1 (NOT p3) (NOT p2)))), (G (NOT (AND p1 p3 p0))), (G (NOT (AND p1 p3 p2 p0))), (G (NOT (AND p1 (NOT p3) p2 p0))), (G (NOT (AND p1 (NOT p2) (NOT p0)))), (G (NOT (AND p1 p3 (NOT p2) p0))), (G (NOT (AND p1 p3 (NOT p2)))), (G (NOT (AND p1 (NOT p3) (NOT p2) p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND p1 p3 p0)))
Knowledge based reduction with 33 factoid took 1130 ms. Reduced automaton from 4 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-14 finished in 33643 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||((!p1||X(!p1)) U (G((!p1||X(!p1)))||(!p2&&(!p1||X(!p1)))))))))'
Support contains 96 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:38:35] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2023-03-12 06:38:35] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:38:36] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
[2023-03-12 06:38:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:36] [INFO ] Invariant cache hit.
[2023-03-12 06:38:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 06:38:36] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:38:36] [INFO ] Invariant cache hit.
[2023-03-12 06:38:36] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:38:36] [INFO ] Implicit Places using invariants and state equation in 327 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 388 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/106 places, 2228/2228 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1193 ms. Remains : 104/106 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s48 1) (GEQ s87 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s48 1) (GEQ s99 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s48 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 602 reset in 7059 ms.
Product exploration explored 100000 steps with 602 reset in 6737 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/104 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 9 factoid took 576 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 894 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 1527 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:38:54] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2023-03-12 06:38:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:38:57] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:39:01] [INFO ] After 3736ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 06:39:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:39:04] [INFO ] After 3309ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 06:39:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:39:07] [INFO ] After 3305ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 06:39:10] [INFO ] After 6523ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3351 ms.
[2023-03-12 06:39:14] [INFO ] After 13289ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 74 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 2227
Applied a total of 2 rules in 167 ms. Remains 103 /104 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:39:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:39:14] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:39:15] [INFO ] Dead Transitions using invariants and state equation in 747 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 103/104 places, 2227/2228 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 899 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 180279 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180279 steps, saw 49315 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:39:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:39:19] [INFO ] Invariant cache hit.
[2023-03-12 06:39:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:39:23] [INFO ] After 3760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:39:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:39:27] [INFO ] After 3414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:39:27] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:39:30] [INFO ] After 3152ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:39:33] [INFO ] After 6262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3161 ms.
[2023-03-12 06:39:36] [INFO ] After 12956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 231 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 178 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:39:36] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:39:36] [INFO ] Invariant cache hit.
[2023-03-12 06:39:37] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-12 06:39:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:39:37] [INFO ] Invariant cache hit.
[2023-03-12 06:39:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:39:37] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-12 06:39:37] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 06:39:37] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:39:37] [INFO ] Invariant cache hit.
[2023-03-12 06:39:38] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1509 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 11 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-12 06:39:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:39:38] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:39:41] [INFO ] After 3250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:39:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:39:45] [INFO ] After 3083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:39:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:39:48] [INFO ] After 3239ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:39:51] [INFO ] After 6134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3352 ms.
[2023-03-12 06:39:54] [INFO ] After 12636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 10 factoid took 472 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 139 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Support contains 74 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Applied a total of 0 rules in 12 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:39:55] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2023-03-12 06:39:55] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:39:56] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
[2023-03-12 06:39:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:39:56] [INFO ] Invariant cache hit.
[2023-03-12 06:39:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 06:39:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:39:56] [INFO ] Invariant cache hit.
[2023-03-12 06:39:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:39:56] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-12 06:39:56] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:39:56] [INFO ] Invariant cache hit.
[2023-03-12 06:39:57] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1699 ms. Remains : 104/104 places, 2228/2228 transitions.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Detected a total of 47/104 stabilizing places and 84/2228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 257 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 82 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:39:59] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:39:59] [INFO ] Invariant cache hit.
[2023-03-12 06:40:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:40:07] [INFO ] After 7074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:40:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:40:14] [INFO ] After 6394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:40:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:40:21] [INFO ] After 6517ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:40:27] [INFO ] After 13218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:40:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 06:40:33] [INFO ] After 25688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 74 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 2227
Applied a total of 2 rules in 170 ms. Remains 103 /104 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:40:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:40:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:40:34] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 103/104 places, 2227/2228 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 1016 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 262826 steps, run timeout after 6001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 262826 steps, saw 69193 distinct states, run finished after 6002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:40:42] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:40:42] [INFO ] Invariant cache hit.
[2023-03-12 06:40:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:40:50] [INFO ] After 6378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:40:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:40:57] [INFO ] After 7122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:40:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:41:03] [INFO ] After 6581ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:41:10] [INFO ] After 13072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:41:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 06:41:15] [INFO ] After 25682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 7 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 162 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 161 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:41:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:41:16] [INFO ] Invariant cache hit.
[2023-03-12 06:41:16] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-12 06:41:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:41:16] [INFO ] Invariant cache hit.
[2023-03-12 06:41:16] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:41:16] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-12 06:41:16] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-12 06:41:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:41:16] [INFO ] Invariant cache hit.
[2023-03-12 06:41:17] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1578 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 9 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-12 06:41:17] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:41:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:41:25] [INFO ] After 7127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:41:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:41:32] [INFO ] After 6914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:41:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:41:39] [INFO ] After 6493ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:41:45] [INFO ] After 12962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6544 ms.
[2023-03-12 06:41:52] [INFO ] After 26580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 255 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 89 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 89 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 123 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 602 reset in 6696 ms.
Product exploration explored 100000 steps with 602 reset in 6440 ms.
Support contains 74 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-12 06:42:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2023-03-12 06:42:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:42:06] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
[2023-03-12 06:42:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:42:06] [INFO ] Invariant cache hit.
[2023-03-12 06:42:06] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-12 06:42:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:42:06] [INFO ] Invariant cache hit.
[2023-03-12 06:42:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:42:07] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-12 06:42:07] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2023-03-12 06:42:07] [INFO ] Invariant cache hit.
[2023-03-12 06:42:07] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1886 ms. Remains : 104/104 places, 2228/2228 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 finished in 213026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0||((!p1||X(!p1)) U (G((!p1||X(!p1)))||(!p2&&(!p1||X(!p1)))))))))'
Found a Lengthening insensitive property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15
Stuttering acceptance computed with spot in 152 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Support contains 96 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 2227
Applied a total of 2 rules in 25 ms. Remains 105 /106 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2023-03-12 06:42:08] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2023-03-12 06:42:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:42:09] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2023-03-12 06:42:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:42:09] [INFO ] Invariant cache hit.
[2023-03-12 06:42:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-12 06:42:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:42:09] [INFO ] Invariant cache hit.
[2023-03-12 06:42:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:42:09] [INFO ] Implicit Places using invariants and state equation in 361 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 408 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 103/106 places, 2227/2228 transitions.
Applied a total of 0 rules in 24 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1073 ms. Remains : 103/106 places, 2227/2228 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s24 1) (GEQ s47 1) (GEQ s86 1)) (AND (GEQ s16 1) (GEQ s24 1) (GEQ s47 1) (GEQ s98 1)) (AND (GEQ s4 1) (GEQ s24 1) (GEQ s47 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 684 reset in 7108 ms.
Product exploration explored 100000 steps with 685 reset in 6888 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 9 factoid took 382 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), true]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 1006 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 1608 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:42:27] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:42:27] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 06:42:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:42:33] [INFO ] After 3719ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 06:42:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:42:37] [INFO ] After 3438ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 06:42:37] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:42:40] [INFO ] After 3038ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 06:42:43] [INFO ] After 6264ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3574 ms.
[2023-03-12 06:42:46] [INFO ] After 13378ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 217 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:42:47] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:42:47] [INFO ] Invariant cache hit.
[2023-03-12 06:42:47] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 961 ms. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 753 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174839 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174839 steps, saw 47882 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 06:42:51] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:42:51] [INFO ] Invariant cache hit.
[2023-03-12 06:42:52] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:42:55] [INFO ] After 3507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:42:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:42:59] [INFO ] After 3579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:42:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:43:02] [INFO ] After 3263ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:43:06] [INFO ] After 6511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3340 ms.
[2023-03-12 06:43:09] [INFO ] After 13519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 192 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 160 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:43:09] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:09] [INFO ] Invariant cache hit.
[2023-03-12 06:43:10] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-12 06:43:10] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:10] [INFO ] Invariant cache hit.
[2023-03-12 06:43:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:43:10] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2023-03-12 06:43:10] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-12 06:43:10] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:10] [INFO ] Invariant cache hit.
[2023-03-12 06:43:11] [INFO ] Dead Transitions using invariants and state equation in 778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1717 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 10 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-12 06:43:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:43:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:43:15] [INFO ] After 3163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 06:43:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:43:18] [INFO ] After 3291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:43:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:43:22] [INFO ] After 3291ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 06:43:25] [INFO ] After 6666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3281 ms.
[2023-03-12 06:43:28] [INFO ] After 13322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 10 factoid took 488 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 133 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Support contains 74 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:43:29] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:43:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:43:30] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
[2023-03-12 06:43:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:30] [INFO ] Invariant cache hit.
[2023-03-12 06:43:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 06:43:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:30] [INFO ] Invariant cache hit.
[2023-03-12 06:43:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:43:30] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-12 06:43:30] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:30] [INFO ] Invariant cache hit.
[2023-03-12 06:43:31] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1673 ms. Remains : 103/103 places, 2227/2227 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/103 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 276 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 89 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 795 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:43:33] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:43:33] [INFO ] Invariant cache hit.
[2023-03-12 06:43:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:43:42] [INFO ] After 7137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:43:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:43:48] [INFO ] After 6503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:43:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:43:55] [INFO ] After 6602ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:44:02] [INFO ] After 13435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:44:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 06:44:08] [INFO ] After 25891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 185 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:44:08] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:44:08] [INFO ] Invariant cache hit.
[2023-03-12 06:44:09] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 975 ms. Remains : 103/103 places, 2227/2227 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 835 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 801 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 134678 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134678 steps, saw 37144 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:44:14] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:44:14] [INFO ] Invariant cache hit.
[2023-03-12 06:44:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:44:22] [INFO ] After 7103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:44:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:44:29] [INFO ] After 6763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:44:29] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:44:35] [INFO ] After 6373ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:44:42] [INFO ] After 13146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:44:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 06:44:48] [INFO ] After 25699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 8 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 185 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 103/103 places, 2227/2227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 185 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:44:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:44:48] [INFO ] Invariant cache hit.
[2023-03-12 06:44:48] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-12 06:44:48] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:44:48] [INFO ] Invariant cache hit.
[2023-03-12 06:44:48] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:44:49] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-12 06:44:49] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-12 06:44:49] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:44:49] [INFO ] Invariant cache hit.
[2023-03-12 06:44:50] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1641 ms. Remains : 103/103 places, 2227/2227 transitions.
Ensure Unique test removed 1938 transitions
Reduce isomorphic transitions removed 1938 transitions.
Iterating post reduction 0 with 1938 rules applied. Total rules applied 1938 place count 103 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1942 place count 101 transition count 287
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1943 place count 101 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1944 place count 100 transition count 286
Applied a total of 1944 rules in 9 ms. Remains 100 /103 variables (removed 3) and now considering 286/2227 (removed 1941) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 286 rows 100 cols
[2023-03-12 06:44:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:44:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 06:44:58] [INFO ] After 7024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:44:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 06:45:05] [INFO ] After 6629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 06:45:11] [INFO ] After 6623ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:45:18] [INFO ] After 13328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6596 ms.
[2023-03-12 06:45:25] [INFO ] After 26665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 375 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 119 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 102 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 95 ms :[true, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 684 reset in 6931 ms.
Product exploration explored 100000 steps with 684 reset in 6843 ms.
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2023-03-12 06:45:39] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2023-03-12 06:45:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-12 06:45:40] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
[2023-03-12 06:45:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:45:40] [INFO ] Invariant cache hit.
[2023-03-12 06:45:40] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-12 06:45:40] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:45:40] [INFO ] Invariant cache hit.
[2023-03-12 06:45:40] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-12 06:45:41] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-12 06:45:41] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
[2023-03-12 06:45:41] [INFO ] Invariant cache hit.
[2023-03-12 06:45:41] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2194 ms. Remains : 103/103 places, 2227/2227 transitions.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLFireability-15 finished in 213827 ms.
[2023-03-12 06:45:42] [INFO ] Flatten gal took : 279 ms
[2023-03-12 06:45:42] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 62 ms.
[2023-03-12 06:45:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 2228 transitions and 17188 arcs took 41 ms.
Total runtime 562165 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2329/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393340 kB
MemFree: 9343356 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16078176 kB
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLFireability-09
Could not compute solution for formula : BridgeAndVehicles-COL-V20P20N50-LTLFireability-15

BK_STOP 1678604438364

--------------------
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-COL-V20P20N50-LTLFireability-02
ltl formula formula --ltl=/tmp/2329/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 2228 transitions and 17188 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.080 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLFireability-04
ltl formula formula --ltl=/tmp/2329/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 106 places, 2228 transitions and 17188 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.060 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BridgeAndVehicles-COL-V20P20N50-LTLFireability-09
ltl formula formula --ltl=/tmp/2329/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 106 places, 2228 transitions and 17188 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.080 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/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-COL-V20P20N50-LTLFireability-15
ltl formula formula --ltl=/tmp/2329/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 2228 transitions and 17188 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.060 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2329/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2329/ltl_3_
Killing (15) : 2353 2354 2355 2356 2357
Killing (9) : 2353 2354 2355 2356 2357

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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